#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;


int main(int argc, char const *argv[])
{
    int k; cin >> k;
    map<string, int> want[20];
    while(k--) {
        int d; cin >> d;
        if (d == 0) {
            int n; cin >> n; n--;
            int m; cin >> m;
            rep(i, m) {
                string a; cin >> a;
                want[n][a]++;
            }
        } else if (d == 1) {
            string b; cin >> b;
            bool f = false;
            rep(i, 20) if (want[i].count(b) && want[i][b] != 0) {
                printf("%d\n", i + 1);
                want[i][b]--;
                f = true;
                break;
            }
            if (!f) printf("-1\n");
        } else {
            int c; cin >> c; c--;
            want[c].clear();
        }
    }
	return 0;
}