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

int main() {
    int n;
    cin>>n;
    map<string,int> seats[20];
    for (int i=0;i<n;i++) {
        int t;
        cin>>t;
        if (t==0) {
            int a,b;
            cin>>a>>b;
            for (int j=0;j<b;j++) {
                string s;
                cin>>s;
                seats[a-1][s]++;
            }
        } else if (t==1) {
            string s;
            cin>>s;
            bool taken=false;
            for (int j=0;j<20;j++) {
                auto it=seats[j].find(s);
                if (it!=seats[j].end()) {
                    cout<<j+1<<endl;
                    seats[j][s]--;
                    if (seats[j][s]==0) {
                        seats[j].erase(it);
                    }
                    taken=true;
                    break;
                }
            }
            if (!taken) cout<<-1<<endl;
        } else if (t==2) {
            int bye;
            cin>>bye;
            seats[bye-1].clear();
        }
    }
    return 0;
}