#include <bits/stdc++.h>
using namespace std;
int n, m, t;
int a[100010];
deque <int>f[301];
deque <int>q;

int main() {
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	cin >> t;
	for (int i = 0; i < t; i++) {
		string u;
		cin >> u;
		if (u[1] == 'u') {
			int d;
			cin >> d;
			q.push_back(a[d]);
			f[a[d]].push_back(d);
		} else {
			while (!f[q.front()].empty()) {
				cout << f[q.front()].front() << endl;
				f[q.front()].pop_front();
			}
			q.pop_front();
		}
	}
	return 0;
}