#include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define de(x) cout<<#x<<" = "<<x<<" "
#define deg(x) cout<<#x<<" = "<<x<<endl
using namespace std;
const int N=2e5+10;
typedef pair<int,int> PII;
int n,m,p,last;
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=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);
}
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>m>>p;
build(1,1,m);
while(m--)
{
string s;
cin>>s;
if(s=="A")
{
int t;
cin>>t;
modify(1,n+1,(t+last)%p);
n++;
}
else
{
int x;
cin>>x;
last=query(1,n-x+1,n);
cout<<last<<endl;
}
}
return 0;
}