import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); UnionFindTree uft = new UnionFindTree(n); int q = sc.nextInt(); StringBuilder sb = new StringBuilder(); while (q-- > 0) { if (sc.nextInt() == 1) { uft.unite(sc.nextInt() - 1, sc.nextInt() - 1); } else { sb.append(uft.getAnother(sc.nextInt() - 1) + 1).append("\n"); } } System.out.print(sb); } static class UnionFindTree { int[] parents; TreeSet exist = new TreeSet<>(); public UnionFindTree(int size) { parents = new int[size]; for (int i = 0; i < size; i++) { parents[i] = i; exist.add(i); } } public int find(int x) { if (x == parents[x]) { return x; } else { return parents[x] = find(parents[x]); } } public boolean same(int x, int y) { return find(x) == find(y); } public void unite(int x, int y) { int xx = find(x); int yy = find(y); if (xx != yy) { parents[xx] = yy; exist.remove(xx); } } public int getAnother(int x) { if (exist.size() == 1) { return -2; } else if (same(x, exist.last())) { return exist.first(); } else { return exist.last(); } } } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }