#include<bits/stdc++.h>
using namespace std;
int n,minn,imm=0,all=0,sum=0,t1,x[1000001],c=0,ae=0;
int rt,tot=0,sz[100001],fa[100001],val[100001],cnt[100001],ch[100001][2];
char op[2];
inline bool get(int x){
	return ch[fa[x]][1]==x;
}
inline void push_up(int x){
	if(!x){
		return;
	}
	sz[x]=cnt[x];
	if(ch[x][0]){
		sz[x]+=sz[ch[x][0]];
	}
	if(ch[x][1]){
		sz[x]+=sz[ch[x][1]];
	}
}
void rotate(int x){
	int y=fa[x],z=fa[y],k=get(x);
	ch[y][k]=ch[x][k^1];fa[ch[x][k^1]]=y;
	ch[x][k^1]=y;fa[y]=x;fa[x]=z;
	if(z){
		ch[z][ch[z][1]==y]=x;
	}
	push_up(y);push_up(x);
}
void splay(int x,int g=0){
	while(fa[x]!=g){
		int y=fa[x],z=fa[y];
		if(z){
			rotate(get(x)==get(y)?y:x);
		}
		rotate(x);
	}
	if(!g){
		rt=x;
	}
}
void find(int x){
	int u=rt;
	if(!u){
		return;
	}
	while(ch[u][val[u]<x]&&val[u]!=x){
		u=ch[u][val[u]<x];
	}
	splay(u,0);
}
int query_kth(int x){
	int u=rt;
	while(1){
		if(ch[u][0]&&sz[ch[u][0]]>=x){
			u=ch[u][0];
		}
		else{
			int tmp=sz[ch[u][0]]+cnt[u];
			if(tmp>=x){
				return val[u];
			}
			u=ch[u][1];x-=tmp;
		}
	}
}
void insert(int x){
	int u=rt,f=0;
	while(u&&val[u]!=x){
		f=u;u=ch[u][val[u]<x];
	}
	if(u){
		++cnt[u];push_up(u);push_up(f);
	}
	else{
		u=++tot;sz[u]=cnt[u]=1;val[u]=x;fa[u]=f;
		if(f){
			ch[f][val[f]<x]=u;push_up(f);
		}
		else{
			rt=u;
		}
	}
	splay(u,0);
}
int pre(int x){
	find(x);
	if(val[rt]<x){
		return rt;
	}
	int u=ch[rt][0];
	while(ch[u][1]){
		u=ch[u][1];
	}
	return u;
}
void del(int x){
	find(x);
	if(cnt[rt]>1){
		--cnt[rt];push_up(rt);return;
	}
	if(!ch[rt][0]&&!ch[rt][1]){
		rt=0;return;
	}
	if(!ch[rt][0]||!ch[rt][1]){
		rt=ch[rt][0]+ch[rt][1];
		fa[rt]=0;return;
	}
	int ort=rt,lb=pre(x);
	splay(lb,0);
	ch[rt][1]=ch[ort][1];fa[ch[ort][1]]=rt;
	push_up(rt);
}
void check(){
	for(int i=1;i<=c;++i){
		if(!x[i]){
			continue;
		}
		if(x[i]+all<minn){
			del(-x[i]);x[i]=0;++sum;
		}
	}
}
int main(){
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout); 
	scanf("%d%d",&n,&minn);
	for(int i=1;i<=n;++i){
		scanf("%s%d",op,&t1);
		if(op[0]=='I'){
			++ae;
			if(t1<minn){
				++sum;++imm;continue;
			}
			x[++c]=t1-all;
			insert(-t1+all);
		}
		else if(op[0]=='A'){
			all+=t1;
		}
		else if(op[0]=='S'){
			all-=t1;
			if(all<0){
				check();
			}
		}
		else if(op[0]=='F'){
			if(ae-sum<t1){
				printf("-1\n");continue;
			}
			printf("%d\n",-query_kth(t1)+all);
		}
	}
	printf("%d",sum-imm);
	return 0;
}

15分求调