import heapq
import sys
sys.setrecursionlimit(500000)
class UF:
  def __init__(self, n):
    self.root = [i for i in range(n)]
    self.subt = [1] * n
    self.child = [[i] for i in range(n)]

  def find(self, x):
    if self.root[x] == x:
      return x
    else:
      self.root[x] = self.find(self.root[x])
      return self.root[x]

  def union(self, x, y):
    x, y = self.find(x), self.find(y)
    if uf.size(x) < uf.size(y):
      x, y = y, x
    if x != y:
      self.subt[x] += self.subt[y]
      self.child[x] += self.child[y]
    self.root[y] = x

  def size(self, x):
    return self.subt[self.find(x)]


n, q = map(int, input().split())
uf = UF(n)
s = set([i for i in range(n)])
for _ in range(q):
  query = list(map(lambda x: int(x)-1, input().split()))
  if query[0]:
    v = query[1]
    if uf.size(v) == n:
      print(-1)
      continue
    v = uf.find(v)
    for cnd in s:
      if cnd != v:
        print(cnd + 1)
        break
  else:
    u, v = query[1:]
    u, v = sorted([u, v])
    if uf.find(u) != uf.find(v):
      s.discard(v)
    uf.union(u, v)