#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <string>

using namespace std;

int scan() {
  int n;
  cin >> n;
  return n;
}

string input() {
  string s;
  cin >> s;
  return s;
}

int main() {
  int n;
  cin >> n;
  vector<multiset<string>> st(20);
  for (int i = 0; i < n; i++) {
    int type;
    cin >> type;
    if (type == 0) {
      int j = scan() - 1;
      int m = scan();
      while (m--) st[j].insert(input());
    } else if (type == 1) {
      int ans = -1;
      string b = input();
      for (int j = 0; j < 20; j++) {
        if (st[j].count(b)) {
          ans = j + 1;
          st[j].erase(st[j].find(b));
          break;
        }
      }
      cout << ans << endl;
    } else {
      st[scan() - 1].clear();
    }
  }
}