#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    vector<multiset<string>> cus(20);
    vector<ll> ans;
    rep(i, n) {
        ll com;
        cin >> com;
        if (com == 0) {
            ll seat, m;
            cin >> seat >> m;
            seat--;
            rep(j, m) {
                string a;
                cin >> a;
                cus[seat].insert(a);
            }
        }
        else if (com == 1) {
            string b;
            cin >> b;
            bool f = false;
            rep(j, 20) {
                if (cus[j].count(b) > 0) {
                    auto it = cus[j].lower_bound(b);
                    cus[j].erase(it);
                    ans.push_back(j + 1);
                    f = true;
                    break;
                }
            }
            if (!f) ans.push_back(-1);
        }
        else if (com == 2) {
            ll c;
            cin >> c;
            c--;
            cus[c].clear();
        }
    }
    rep(i, sz(ans)) printf("%lld\n", ans[i]);
    return 0;
}