# include <bits/stdc++.h>
using namespace std;
int m, p, t, num, last, cnt;
const int N = 2e5 + 10;
struct node{
int l, r;
int v;
} tr[4 * N];
void build(int u, int l, int r)
{
tr[u].l = l;
tr[u].r = r;
if(l == r) return;
int mid = l + r >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid + 1, r);
}
void pushup(int u)
{
tr[u].v = max(tr[u << 1].v, tr[u << 1 | 1].v);
}
void modify(int u, int x, int v)
{
if(tr[u].l == tr[u].r) 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 query(int u, int l, int r)
{
if(l <= tr[u].l && tr[u].r <= r) return tr[u].v;
int v = 0, mid = tr[u].l + tr[u].r >> 1;
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;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> m >> p;
build(1, 1, m);
for(int i = 1; i <= m; i ++)
{
char t;
cin >> t >> num;
if(t == 'A') modify(1, ++cnt, (num + last) % p);
else
last = query(1, cnt - num + 1, cnt), cout << last << endl;
}
}