class UnionFind def initialize(n) @size = Array.new(n, 1) @rank = Array.new(n, 0) @parent = [] (0..n).each do |i| @parent[i] = i end end def find(x) if @parent[x] == x x else @parent[x] = find(@parent[x]) end end def unite(x, y) x = find(x) y = find(y) return if x == y if @rank[x] < @rank[y] @parent[x] = y @size[y] += @size[x] else @parent[y] = x @size[x] += @size[y] @rank[x] += 1 if @rank[x] == @rank[y] end end def same?(x, y) find(x) == find(y) end def size(x) @size[find(x)] end end N, Q = gets.split.map(&:to_i) uf = UnionFind.new(N + 1) cur = 2 Q.times do q = gets.split.map(&:to_i) case q[0] when 1 u, v = q[1..2].sort uf.unite(u, v) while uf.find(cur) == 1 && cur <= N cur += 1 end when 2 v = q[1] par = uf.find(v) if cur > N puts -1 elsif par != 1 puts 1 else puts cur end end end