import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum S = 25;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto TYP = new int[N];
      auto L = new int[N];
      auto M = new int[N];
      auto A = new string[][N];
      auto B = new string[N];
      auto C = new int[N];
      foreach (i; 0 .. N) {
        TYP[i] = readInt();
        switch (TYP[i]) {
          case 0: {
            L[i] = readInt();
            M[i] = readInt();
            A[i] = new string[M[i]];
            foreach (j; 0 .. M[i]) {
              A[i][j] = readToken();
            }
          } break;
          case 1: {
            B[i] = readToken();
          } break;
          case 2: {
            C[i] = readInt();
          } break;
          default: assert(false);
        }
      }
      
      int T;
      int[string] tr;
      foreach (i; 0 .. N) {
        switch (TYP[i]) {
          case 0: {
            foreach (j; 0 .. M[i]) {
              if (A[i][j] !in tr) {
                tr[A[i][j]] = T++;
              }
            }
          } break;
          case 1: {
            if (B[i] !in tr) {
              tr[B[i]] = T++;
            }
          } break;
          case 2: {
            //
          } break;
          default: assert(false);
        }
      }
      
      auto wants = new int[][S];
      foreach (i; 0 .. N) {
        switch (TYP[i]) {
          case 0: {
            wants[L[i]] = new int[T];
            foreach (j; 0 .. M[i]) {
              ++wants[L[i]][tr[A[i][j]]];
            }
          } break;
          case 1: {
            const t = tr[B[i]];
            int ans = -1;
            foreach (s; 0 .. S) {
              if (wants[s] && wants[s][t] > 0) {
                ans = s;
                --wants[s][t];
                break;
              }
            }
            writeln(ans);
          } break;
          case 2: {
            wants[C[i]] = null;
          } break;
          default: assert(false);
        }
      }
    }
  } catch (EOFException e) {
  }
}