#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int M=;

int read(){

    int ans=,f=,c=getchar();

    while(c<''||c>''){if(c=='-') f=-; c=getchar();}

    while(c>=''&&c<=''){ans=ans*+(c-''); c=getchar();}

    return ans*f;

}

int n,m,sum,mn,leave,delta;

struct node{

    node *l,*r;

    int sz,v,rnd;

    void init(int w){sz=; v=w; rnd=rand();}

    void up(){

        sz=;

        if(l) sz+=l->sz;

        if(r) sz+=r->sz;

    }

    void split(node*&lw,node*&rw,int w){

        if(!this){lw=; rw=; return ;}

        if(w<=v){

            l->split(lw,l,w);

            rw=this;

        }

        else{

            r->split(r,rw,w);

            lw=this;

        }

        up();

    }

    int find(int rank){

        if(!this) return ;

        int ls=l?l->sz:;

        if(ls+==rank) return v;

        else if(ls>=rank) return l->find(rank);

        else return r->find(rank-ls-);

    }

}tr[M],*rt;

node* merge(node*a,node*b){

    if(!a) return b;

    if(!b) return a;

    if(a->rnd>b->rnd){

        a->r=merge(a->r,b);

        a->up();

        return a;

    }{

        b->l=merge(a,b->l);

        b->up();

        return b;

    }

}

int main()

{

    char ch[];

    int w;

    n=read(); mn=read();

    while(n--){

        scanf("%s",ch); w=read();

        if(ch[]=='I'&&w>=mn){

            tr[++sum].init(w-delta);

            node *p1,*p2;

            rt->split(p1,p2,w-delta);

            rt=merge(merge(p1,tr+sum),p2);

        }

        if(ch[]=='A') delta+=w;

        if(ch[]=='S'){

            node *p;

            delta-=w; rt->split(p,rt,mn-delta);

            if(p) leave+=p->sz;

        }

        if(ch[]=='F'){

            if(!rt||w>rt->sz) { printf("-1\n"); continue;}

            printf("%d\n",rt->find(rt->sz-w+)+delta);

        }

    }

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

    return ;

}