#include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cstring>
#include<cmath>
#include<numeric>
#include<queue>
#include<climits>
#include<cstdio>
#include<map>

#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++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
//#define INF ((LLONG_MAX) / (2))
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long int ll;
typedef pair<ll,int> LL_IP;
typedef pair<ll,ll> LL_LLP;
#define INF 1e9+7


int main(){

    map<string,int> mp[21];
    int n;
    cin >> n;
    REP(i,n){
        
        int num = 0;
        cin >> num;
        if(num == 0){
            int n,m;
            string t;
            cin >> n >> m;
            for(int j = 0;j < m;j++){
                cin >> t;
                mp[n][t]++;
            }
        }else if(num == 1){
            string s;
            cin >> s;
            bool exist = false;
            for(int j = 0;j < 21;j++){
                if(mp[j][s]){
                    mp[j][s]--;
                    exist = true;
                    cout << j << endl;
                    break;
                }
            }
            if(!exist){
                cout << "-1" << endl;
            }
        }else{
            int c = 0;
            cin >> c;
            mp[c].clear();
        }
    }


    return 0;
}