#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; } template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } templatevector make_v(size_t a){return vector(a);} templateauto make_v(size_t a,Ts... ts){return vector(ts...))>(a,make_v(ts...));} template typename enable_if::value==0>::type fill_v(T &t,const V &v){t=v;} template typename enable_if::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);} /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ template Type solve(Type res = Type()){ int N; cin >> N; vector> G(21); while(N--){ int com; cin >> com; if(com == 0){ int n,m; cin >> n >> m; G[n].resize(m); for(auto& in:G[n]) cin >> in; }else if(com == 1){ string B; cin >> B; int id = -1; for(int i = 1; i <= 20;i++){ if(count(G[i].begin(),G[i].end(),B)){ id = i; break; } } cout << id << endl; }else{ int C; cin >> C; G[C].clear(); } } return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); solve(0); // cout << fixed << setprecision(15) << solve() << endl; return 0; }