#include<bits/stdc++.h>
#define IT list<pair<int,int> >::iterator
using namespace std;
int team[100010];
int n,m,t,tmp;
string str;
list<pair<int,int> >q;
int main(){
//	freopen("queue.in","r",stdin);
//	freopen("queue.out","w",stdout);
	cin>>n>>m;
	for(int i=0;i<n;i++)
		cin>>team[i];
	cin>>t;
	while(t-->/*C语言隐藏操作符 迭代符（雾*/0){
		cin>>str;
		if(str=="push"){
			short f=1;
			cin>>tmp;
			const IT ITBEGIN=q.begin();
			for(IT it=q.end();it!=ITBEGIN&&q.size();--it){ 
				if(it==q.end())
					continue;
				else if((*it).first==team[tmp]){
					q.insert(it,make_pair(team[tmp],tmp));
					f=0;
				}
			}
			if(f&&q.front().first==team[tmp])
				q.insert(q.begin(),make_pair(team[tmp],tmp));
			else if(f) q.insert(q.end(),make_pair(team[tmp],tmp));	
		}else{
			cout<<q.front().second<<endl;
			q.erase(q.begin());
		}
	}
	return 0;
}