#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

int N;
multiset<string> S[21];

void solve() {
    cin >> N;

    rep(i, N) {
        int U;
        cin >> U;
        if (U == 0) {
            int n, m;
            cin >> n >> m;
            rep(j, m) {
                string t;
                cin >> t;
                S[n].insert(t);
            }
        } else if (U == 1) {
            int ans = -1;
            string t;
            cin >> t;
            FOR(j, 1, 21)if (S[j].count(t)) {
                ans = j;
                S[j].erase(S[j].find(t));
                break;
            }
            cout << ans << endl;
        } else {
            int n;
            cin >> n;
            S[n].clear();
        }
    }
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}