#include<bits/stdc++.h>
using namespace std;
int n,m,t,ans;
char cmd[5];
struct node{
	node *l,*r;
	int val,fix,weight;
	int size,lsize,rsize;
};
void Update_Size(node*& root){
	if(root==NULL) return;
	int ans=root->weight;
	if(root->l!=NULL) ans+=root->l->size;
	if(root->r!=NULL) ans+=root->r->size;
	root->size=ans;
}
void Left_Rotate(node*& root){
	node* tmp=root->r;
	root->r=tmp->l;
	tmp->l=root;
	Update_Size(root);
	Update_Size(tmp);
	root=tmp;
}
void Right_Rotate(node*& root){
	node* tmp=root->l;
	root->l=tmp->r;
	tmp->r=root;
	Update_Size(root);
	Update_Size(tmp);
	root=tmp;
}
void Treap_Insert(node*& root,int v){
	if(root==NULL){
		root=new node();
		root->l=NULL,root->r=NULL;
		root->size=1;
		root->val=v;
		root->weight=1;
		root->fix=rand();
		return;
	}
	if(v<root->val){
		Treap_Insert(root->l,v);
		if(root->l->fix<root->fix) Right_Rotate(root);
		Update_Size(root);
	}
	else if(v>root->val){
		Treap_Insert(root->r,v);
		if(root->r->fix<root->fix) Left_Rotate(root);
		Update_Size(root);
	}else{
		root->size++;
		root->weight++;
		return;
	}
}
void Treap_Delete(node*& root,int v){
	if(root==NULL) return;
	if(root->val!=v){
		if(v<root->val) Treap_Delete(root->l,v);
		else Treap_Delete(root->r,v);
		Update_Size(root);
		return;
	}
	if(root->weight>1){
		root->weight--;
		root->size--;
		return;
	}
	node* tmp=root;
	if(root->l==NULL&&root->r==NULL){
		root=NULL;
	}else if(root->l==NULL&&root->r!=NULL){
		root=tmp->r;
	}else if(root->l!=NULL&&root->r==NULL){
		root=tmp->l;
	}else if(root->l!=NULL&&root->r!=NULL){
		if(root->l->fix<root->r->fix){
			Right_Rotate(root);
			Treap_Delete(root->r,v);
		}else{
			Left_Rotate(root);
			Treap_Delete(root->l,v);
		}
	}
	Update_Size(root);
}
int Get_The_Kth_Node(node* root,int k){
	if(root==NULL) return -1;
	int tmp=root->l==NULL?0:root->l->size;
	if(k<=tmp) return Get_The_Kth_Node(root->l,k);
	else if(k<=tmp+root->weight) return root->val;
	else return Get_The_Kth_Node(root->r,k-(tmp+root->weight));
	return -1;
}
int Get_Rank(node* root,int v){
	int tmp=root->l==NULL?0:root->l->size;
	if(v==root->val) return tmp+1;
	else if(v<root->val) return (root->l==NULL?1:Get_Rank(root->l,v));
	else return (root->r==NULL?root->size+1:tmp+root->weight+Get_Rank(root->r,v));
}
void Treap_Add(node*& root,int k){
	if(root==NULL) return;
	root->val+=k;
	Treap_Add(root->l,k);
	Treap_Add(root->r,k);
}
void Treap_Judge(node*& root){
	if(root==NULL) return;
	Treap_Judge(root->l);
	Treap_Judge(root->r);
	if(root->val<m) ans+=root->weight,Treap_Delete(root,root->val);
}
void Treap_Out(node*& root){
	if(root==NULL) return;
	printf("%d ",root->val);
	Treap_Out(root->l);
	Treap_Out(root->r);
}
node* root;
int main(){
//	freopen("P1486_in.in","r",stdin);
//	freopen("P1486_out.out","w",stdout);
	srand(time(0));
	scanf("%d%d",&n,&m);
	while(n--){
		Update_Size(root);
//		printf("size=%d\n",root==NULL?0:root->size);
		scanf("%s%d",&cmd,&t);
		if(cmd[0]=='I'){
			if(t>=m) Treap_Insert(root,t);
		}else if(cmd[0]=='A'){
			Treap_Add(root,t);
			Treap_Judge(root);
		}else if(cmd[0]=='S'){
			Treap_Add(root,-t);
			Treap_Judge(root);
		}else if(cmd[0]=='F'){
			if(root==NULL||t>root->size) printf("-1\n");
			else printf("%d\n",Get_The_Kth_Node(root,root->size-t+1));
		}
//		Treap_Out(root);
//		printf("\nans=%d\n",ans);
	}
	printf("%d\n",ans);
}