#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n;
	cin>>n;
	map<string, int> mp[20];
	for(int i=0; i<n; i++){
		int t;
		cin>>t;
		if(t==0){
			int n0, m;
			cin>>n0>>m;
			n0--;
			for(int j=0; j<m; j++){
				string a;
				cin>>a;
				if(mp[n0].find(a)==mp[n0].end()){
					mp[n0][a]=1;
				}else{
					mp[n0][a]++;
				}
			}
		}else if(t==1){
			string b;
			cin>>b;
			bool e=0;
			for(int i=0; i<20; i++){
				if(mp[i].find(b)!=mp[i].end()){
					mp[i][b]--;
					if(mp[i][b]==0){
						mp[i].erase(b);
					}
					cout<<(i+1)<<endl;
					e=1;
					break;
				}
			}
			if(e==0){
				cout<<-1<<endl;
			}
		}else{
			int c;
			cin>>c;
			c--;
			mp[c].clear();
		}
	}
	return 0;
}