#include<bits/stdc++.h>
#ifndef ONLINE_JUDGE
#include "debug.cpp"
#endif
using namespace std;

struct node{int data;int xb;};
vector<vector<node> > q;
char s[5];
int a[100005];
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	//q.push_back({});
	for(int i=0;i<n;i++){
		int x;
		scanf("%d",&x);
		a[i]=x;
	}
//-------------------------------------------------------------
	int j=0;
	int T;
	scanf("%d",&T);getchar();
	for(int i=0;i<T;i++)
	{
		//printf("%d\n",i);
		scanf("%s",s);
		//getchar();
		//printf("%s\n",s/*,s=="pop\0"*/);
		if(!strcmp(s,"pop"))
		{
			printf("%d\n",q[j].front().xb);
			q[j].erase(q[j].begin());
			//q[j].pop_back();
			if(q[j].size()==0)
				j++;
			//PrintV(q[0].begin(),q[0].end());
		}
		else{
			bool flag=false;
			int t;
			scanf("%d",&t);
			//getchar();
			//printf("%d\n",t);
			int len=q.size();
			//printf("%d\n",len);
			for(int p=j;p<len;p++){
				//printf("\t%d\n",p);
				if(q[p][0].data==a[t]){
					flag=true;
					q[p].push_back({a[t],t});
					break;
				}
			}	
			//getchar();getchar();getchar();getchar();getchar();getchar();
			if(!flag){
				q.push_back({});
				q.back().push_back({a[t],t});
			}		
		}
		//for(int p=j;p<q.size();p++)
		//	PrintV(q[p].begin(),q[p].end());
	}
    return 0;
}