/**************************************************************

     Problem: 1012

     User: Tunix

     Language: C++

     Result: Accepted

     Time:768 ms

     Memory:4396 kb

 ****************************************************************/

 //BZOJ 1012

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 #define pb push_back

 using namespace std;

 inline int getint(){

     int v=,sign=; char ch=getchar();

     while(ch<''||ch>''){ if (ch=='-') sign=-; ch=getchar();}

     while(ch>=''&&ch<=''){ v=v*+ch-''; ch=getchar();}

     return v*sign;

 }

 const int N=2e5+,INF=~0u>>;

 typedef long long LL;

 /******************tamplate*********************/

 int n,m,D;

 int t[N<<];

 #define L (o<<1)

 #define R (o<<1|1)

 #define mid (l+r>>1)

 void update(int o,int l,int r,int pos,int val){

     if (l==r) t[o]=val;

     else{

         if(pos<=mid) update(L,l,mid,pos,val);

         else update(R,mid+,r,pos,val);

         t[o]=max(t[L],t[R]);

     }

 }

 int ql,qr;

 int query(int o,int l,int r){

     if (ql<=l && qr>=r) return t[o];

     else{

         int ans=;

         if (ql<=mid) ans=max(ans,query(L,l,mid));

         if (qr>mid) ans=max(ans,query(R,mid+,r));

         return ans;

     }

 }

 int main(){

 #ifndef ONLINE_JUDGE

     freopen("1012.in","r",stdin);

     freopen("1012.out","w",stdout);

 #endif

     n=getint(); D=getint();

     int t=,x,ed=;

     char cmd[];

     F(i,,n){

         scanf("%s",cmd); x=getint();

         if (cmd[]=='Q'){

             ql=ed-x+; qr=ed;

             t=query(,,n);

             printf("%d\n",t);

         }else{

             ++ed;

             update(,,n,ed,(x+t)%D);

         }

     }

     return ;

 }