import java.io.InputStream; import java.io.PrintWriter; import java.lang.reflect.Array; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.Map; import java.util.Map.Entry; import java.util.PriorityQueue; import java.util.Scanner; import java.util.Set; import java.util.Stack; import java.util.TreeMap; import java.util.TreeSet; import static java.util.Comparator.*; public class Main { public static void main(String[] args) { PrintWriter out = new PrintWriter(System.out); Solver solver = new Solver(System.in, out); solver.solve(); out.close(); } } class Solver { Scanner sc; PrintWriter out; public Solver(InputStream in, PrintWriter out) { sc = new Scanner(in); this.out = out; } // ================================================================== Map> data = new TreeMap<>(); public void solve() { int N = Integer.parseInt(sc.next()); int cmd, no, wk; Integer cnt; boolean f; Map map; String name; for (int i = 0; i < N; i++) { cmd = Integer.parseInt(sc.next()); if(cmd == 0) { no = Integer.parseInt(sc.next()); map = new HashMap<>(); data.put(no, map); wk = Integer.parseInt(sc.next()); // out.println("登録  席 = " + no + " ネタの数 = " + wk); for (int j = 0; j < wk; j++) { name = sc.next(); cnt = map.get(name); if(cnt == null) map.put(name, 1); else map.put(name, cnt + 1); // out.println("  ネタ [" + name + "] = " + map.get(name)); } } else if(cmd == 1) { name = sc.next(); // out.println("回ってきた [" + name + "]"); f = false; for(Integer key : data.keySet()) { map = data.get(key); cnt = map.get(name); // out.println(" 席 = " + key + " ネタの数 = " + cnt); if(cnt == null) continue; else if(cnt > 1) map.put(name, cnt - 1); else map.remove(name); out.println(key); f = true; break; } if(!f) out.println(-1); } else { no = Integer.parseInt(sc.next()); // out.println("席 = " + no + " 会計へ"); data.remove(no); } } } }