1 /**************************************************************
 2     Problem: 1012
 3     User: Tunix
 4     Language: C++
 5     Result: Accepted
 6     Time:768 ms
 7     Memory:4396 kb
 8 ****************************************************************/
 9  
10 //BZOJ 1012
11 #include<vector>
12 #include<cstdio>
13 #include<cstring>
14 #include<cstdlib>
15 #include<iostream>
16 #include<algorithm>
17 #define rep(i,n) for(int i=0;i<n;++i)
18 #define F(i,j,n) for(int i=j;i<=n;++i)
19 #define D(i,j,n) for(int i=j;i>=n;--i)
20 #define pb push_back
21 using namespace std;
22 inline int getint(){
23     int v=0,sign=1; char ch=getchar();
24     while(ch<‘0‘||ch>‘9‘){ if (ch==‘-‘) sign=-1; ch=getchar();}
25     while(ch>=‘0‘&&ch<=‘9‘){ v=v*10+ch-‘0‘; ch=getchar();}
26     return v*sign;
27 }
28 const int N=2e5+10,INF=~0u>>2;
29 typedef long long LL;
30 /******************tamplate*********************/
31 int n,m,D;
32 int t[N<<2];
33 #define L (o<<1)
34 #define R (o<<1|1)
35 #define mid (l+r>>1)
36 void update(int o,int l,int r,int pos,int val){
37     if (l==r) t[o]=val;
38     else{
39         if(pos<=mid) update(L,l,mid,pos,val);
40         else update(R,mid+1,r,pos,val);
41         t[o]=max(t[L],t[R]);
42     }
43 }
44 int ql,qr;
45 int query(int o,int l,int r){
46     if (ql<=l && qr>=r) return t[o];
47     else{
48         int ans=0;
49         if (ql<=mid) ans=max(ans,query(L,l,mid));
50         if (qr>mid) ans=max(ans,query(R,mid+1,r));
51         return ans;
52     }
53 }
54 int main(){
55 #ifndef ONLINE_JUDGE
56     freopen("1012.in","r",stdin);
57     freopen("1012.out","w",stdout);
58 #endif
59     n=getint(); D=getint();
60     int t=0,x,ed=0;
61     char cmd[4];
62     F(i,1,n){
63         scanf("%s",cmd); x=getint();
64         if (cmd[0]==‘Q‘){
65             ql=ed-x+1; qr=ed;
66             t=query(1,1,n);
67             printf("%d\n",t);
68         }else{
69             ++ed;
70             update(1,1,n,ed,(x+t)%D);
71         }
72     }
73     return 0;
74 }