#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<ll, pair<ll, ll> > P3;

const ll MOD = ll(1e9 + 7);
const ll LLINF = LLONG_MAX;
const int IINF = INT_MAX;
const int MAX_N = int(2e3) + 5;
const double EPS = 1e-8;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((v).rbegin(), (v).rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)

int main() {
    int n;
    cin >> n;
    vector<string> ls[20];
    REP(i,n){
        int u;
        cin >> u;
        if(u==0){
            int k,m;
            cin >> k >> m;
            REP(j,m){
                string t;
                cin >> t;
                ls[k-1].push_back(t);
            }
        }
        else if(u==1){
            string t;
            cin >> t;
            bool f = false;
            REP(k,20){
                REP(j,ls[k].size()){
                    if(ls[k][j] == t){
                        cout << k+1 << endl;
                        ls[k].erase(ls[k].begin()+j);
                        f = true;
                        break;
                    }
                }
                if(f)break;
            }
            if(!f){
                cout << -1 << endl;
            }
        }
        else{
            int k;
            cin >> k;
            ls[k-1].clear();
        }
    }
    return 0;
}