#include <bits/stdc++.h>
using namespace std;
const int  N =  200010;
int m,p;
struct Node
{
    int l,r;
    int v;
} tr[N*4];

void pushup(int u)
{
    tr[u].v = max(tr[u<<1].v,tr[u<<1|1].v);
}
void build(int u,int l,int r )
{
    tr[u] = {l,r};
    if(l  ==  r) return ;
    int mid  = l+r>>1;
    build(u<<1,l,mid),build(u<<1|1,mid+1,r) ;
}
int query(int u,int l,int r)
{
    if(tr[u].l >= l && tr[u].r<=r)
        return tr[u].v;

    int mid = tr[u].l+tr[u].r>>1;
    int v = 0;
    if(l<=mid) v = max(v,query(u<<1,l,r));
    if(r>mid)  v=  max(v,query(u<<1|1,l,r));
    return v;

}
void modify(int u,int x,int v)
{
    if(tr[u].l == x&&tr[u].r==x) tr[u].v = v;
    else
    {
        int mid = tr[u].l+tr[u].r>>1;
        if(x<=mid) modify(u<<1,x,v);
        else modify(u<<1|1,x,v);
        pushup(u);

    }
}
int main()
{
    int n = 0, last = 0;
    scanf("%d%d", &m, &p);
    build(1, 1, m);

    int x;
    char op[2];
    while (m -- )
    {
        scanf("%s%d", op, &x);
        if (*op == 'Q')
        {
            last = query(1, n - x + 1, n);
            printf("%d\n", last);
        }
        else
        {
            modify(1, n + 1, (last + x) % p);
            n ++ ;
        }
    }



    return 0;
}