#include<cstdio>

 #include<algorithm>

 #define ls (a[u].l)

 #define rs (a[u].r)

 using namespace std;

 const int maxn=;

 int n,k,x,y,z,v,tot,root,Minwage,Minnow,delta;

 char c,c2;

 struct treap{int l,r,v,rnd,size;}a[maxn];

 inline int read(){

     int k=,f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

     while(''<=c&&c<='')k=k*+c-'',c=getchar();

     return k*f;

 }

 void newnode(int val){a[++tot]=(treap){,,val,rand()+,};}

 void update(int u){a[u].size=a[ls].size+a[rs].size+;}

 void split(int u,int k,int &x,int &y){

     if(!k){x=; y=u; return;}

     if(a[u].size==k){x=u; y=; return;}

     if(a[ls].size>=k) split(ls,k,x,ls),y=u;

     else split(rs,k-a[ls].size-,rs,y),x=u;

     update(u);

 }

 int merge(int x,int y){

     if(!x||!y) return x+y;

     if(a[x].rnd<a[y].rnd){a[x].r=merge(a[x].r,y); update(x); return x;}

     else{a[y].l=merge(x,a[y].l); update(y); return y;}

 }

 int qrank(int u,int val){

     if(!u) return ;

     return a[u].v>=val?qrank(ls,val):qrank(rs,val)+a[ls].size+;

 }

 int qval(int u,int k){

     if(a[ls].size+==k) return a[u].v;

     return a[ls].size>=k?qval(ls,k):qval(rs,k-a[ls].size-);

 }

 int main(){

     srand();

     n=read(); Minwage=Minnow=read();

     while(n--){

         c=getchar();

         while(c!='I'&&c!='A'&&c!='S'&&c!='F') c=getchar();

         c2=getchar(); v=read();

         if(c=='I'&&v>=Minwage){

             split(root,qrank(root,v-delta),x,y);

             newnode(v-delta); root=merge(merge(x,tot),y);

         }

         if(c=='A') Minnow-=v,delta+=v;

         if(c=='S'){

             Minnow+=v; delta-=v;

             split(root,qrank(root,Minnow),x,y);

             root=y;

         }

         if(c=='F') printf("%d\n",a[root].size>=v?qval(root,a[root].size-v+)+delta:-);

     }

     return printf("%d",tot-a[root].size),;

 }