#include<bits/stdc++.h>
using namespace std;
int a[200001],m[2000001];
int main(){
    int n,d,l=0,x,ans=0;
    char f[4];
    scanf("%d%d",&n,&d);
    while(n--){
        scanf("%s%d",f,&x);
        if(f[0]==‘A‘){
            a[++l]=(x+ans)%d;
            for(int i=l;i>=1;i--){
                if(m[i]<a[l])m[i]=a[l];
                else break;
            }
        }
        else {
            ans=m[l-x+1];
            printf("%d\n",ans);
        }
    }
}