#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };


int main() {
	int n;
	cin >> n;

	vector<string>li[30];
	rep(i, 0, n) {
		int q;
		cin >> q;
		if (q == 0) {
			int place, num;
			cin >> place >> num;
			rep(i, 0, num) {
				string s;
				cin >> s;
				li[place].pb(s);
			}
		}
		else if (q == 1) {
			string s;
			cin >> s;
			int rec = -1;
			rep(i, 0, 30) {
				rep(j, 0, li[i].size()) {
					if (rec == -1 && li[i][j] == s) {
						rec = i;
						li[i].erase(li[i].begin()+j);
					}
				}
			}
			cout << rec << endl;
		}
		else {
			int place;
			cin >> place;
			li[place].clear();
		}
	}

	
	return 0;
}