#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>

using namespace std;
#define TOSTRING(x) #x
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase( unique(ALL(v)) , v.end());
#define PAU system("pause")

typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vb> vvb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 28);
const double PI = acos(-1);

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	vector< vector<string> > V(20);//0-indexed
	REP(i, N) {
		int q;
		cin >> q;
		int n, m, c;
		string b;
		bool found = false;
		switch (q) {
			case 0:
				cin >> n >> m;
				n--;
				REP(j, m) {
					string s;
					cin >> s;
					V[n].push_back(s);
				}
				break;
			case 1:
				cin >> b;
				found = false;
				REP(j, 20) {
					REP(k, SZ(V[j])) {
						if (V[j][k] == b) {
							found = true;
							cout << j + 1 << endl;
							V[j].erase(V[j].begin() + k);
							break;
						}
					}
					if (found)break;
				}
				if (!found)cout << -1 << endl;
				break;
			case 2:
				int c;
				cin >> c;
				c--;
				V[c].clear();
				break;
		}
	}
	PAU;
	return 0;
}