#include<cstdio>
#include<ctime>
#include<cstring>
#include<cstdlib>
#include<algorithm>using namespace std;inline int in(){int x=0;char ch=getchar();while(ch>'9' || ch<'0') ch=getchar();while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();return x;
}const int maxn=100010;struct Node{int f,ch[2];int sz,ct;int dt,pt;
}s[maxn];int m,Min,n,rt;void push_down(int x){if(!s[x].pt) return;if(s[x].ch[0]) s[s[x].ch[0]].dt+=s[x].pt,s[s[x].ch[0]].pt+=s[x].pt;if(s[x].ch[1]) s[s[x].ch[1]].dt+=s[x].pt,s[s[x].ch[1]].pt+=s[x].pt;s[x].pt=0;
}void update(int x){s[x].sz=s[s[x].ch[0]].sz+s[s[x].ch[1]].sz+s[x].ct;
}int Find(int k){int p=rt;if(s[rt].sz<k || k<=0) return -1;while(p){push_down(p);if(k<=s[s[p].ch[0]].sz) p=s[p].ch[0];else{k-=s[s[p].ch[0]].sz;if(k<=s[p].ct) return p;k-=s[p].ct;p=s[p].ch[1];}}
}void Rotate(int x,int k){int y=s[x].f;s[x].f=s[y].f;if(s[y].f){if(s[s[y].f].ch[0]==y) s[s[y].f].ch[0]=x;else s[s[y].f].ch[1]=x;}s[y].ch[k]=s[x].ch[k^1];if(s[x].ch[k^1]) s[s[x].ch[k^1]].f=y;s[y].f=x,s[x].ch[k^1]=y;update(y),update(x);
}void Splay(int x,int gf){int y;while(s[x].f!=gf){y=s[x].f;if(s[y].f==gf){if(x==s[y].ch[0]) Rotate(x,0); else Rotate(x,1);}else{int z=s[y].f;if(y==s[z].ch[0]){if(x==s[y].ch[0]) Rotate(y,0),Rotate(x,0);else Rotate(x,1),Rotate(x,0);}else{if(x==s[y].ch[1]) Rotate(y,1),Rotate(x,1);else Rotate(x,0),Rotate(x,1);}}}if(!gf) rt=x;
}void Insert(int x){if(x<Min) return;if(!rt){s[++n].dt=x;s[n].sz=1;rt=n,s[n].ct=1;return;}int p=rt;while(p){s[p].sz++;push_down(p);if(s[p].dt<x){if(s[p].ch[1]) p=s[p].ch[1];else{s[p].ch[1]=++n,s[n].dt=x,s[n].sz=1,s[n].f=p,s[n].ct=1;break;}}else if(s[p].dt>x){if(s[p].ch[0]) p=s[p].ch[0];else{s[p].ch[0]=++n,s[n].dt=x,s[n].sz=1,s[n].f=p,s[n].ct=1;break;}}else{n++;s[p].ct++;return;}}if(rand()%100>80) Splay(n,0);
}void Addition(int x){s[rt].dt+=x,s[rt].pt+=x;
}void Shorten(int x){int p=rt,bye=Min+x,rec=-1;while(p){push_down(p);if(s[p].dt<bye)rec=p,p=s[p].ch[1];elsep=s[p].ch[0];}if(rec!=-1){Splay(rec,0);rt=s[rec].ch[1],s[rt].f=0;if(rt) update(rt);}if(rt) s[rt].dt-=x,s[rt].pt-=x;
}int Get_kth(int k){int x=Find(s[rt].sz-k+1);if(x<0) return -1;if(rand()%100>80) Splay(x,0);return s[x].dt;
}int main(){
#ifndef ONLINE_JUDGEfreopen("1503.in","r",stdin);freopen("1503.out","w",stdout);
#endifint k;char ord[2];scanf("%d%d",&m,&Min);while(m--){scanf("%s",ord);k=in();if(ord[0]=='I') Insert(k);else if(ord[0]=='A') Addition(k);else if(ord[0]=='S') Shorten(k);else if(ord[0]=='F') printf("%d\n",Get_kth(k));}printf("%d",n-s[rt].sz);return 0;
}