#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<multiset<string>> customer(20);
	while (N--) {
		int q;
		scanf("%d", &q);
		if (q == 0) {
			int n, m;
			scanf("%d %d", &n, &m);
			--n;
			while (m--) {
				string s;
				cin >> s;
				customer[n].insert(s);
			}
		}
		else if (q == 1) {
			string b;
			cin >> b;
			int ans = -1;
			REP(i, customer.size()) {
				auto it = customer[i].find(b);
				if (it != customer[i].end()) {
					ans = i + 1;
					customer[i].erase(it);
					break;
				}
			}
			printf("%d\n", ans);
		}
		else {
			int c;
			scanf("%d", &c);
			customer[c - 1].clear();
		}
	}
}