from sys import stdin
input=lambda :stdin.readline()[:-1]

from collections import defaultdict

class UnionFind():
  def __init__(self,n):
    self.n=n
    self.parents=[-1]*n
    self.grp_cnt=n

  def find(self,x):
    if self.parents[x]<0:
      return x
    else:
      self.parents[x]=self.find(self.parents[x])
      return self.parents[x]

  def union(self,x,y):
    x=self.find(x)
    y=self.find(y)

    if x==y:
      return

    if self.parents[x]>self.parents[y]:
      x,y=y,x

    self.parents[x]+=self.parents[y]
    self.parents[y]=x
    self.grp_cnt-=1

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

  def same(self,x,y):
    return self.find(x)==self.find(y)

  def members(self,x):
    root=self.find(x)
    return [i for i in range(self.n) if self.find(i)==root]

  def roots(self):
    return [i for i, x in enumerate(self.parents) if x< 0]

  def group_count(self):
    return len(self.roots())

  def all_group_members(self):
    group_members=defaultdict(list)
    for member in range(self.n):
      group_members[self.find(member)].append(member)
    return group_members

n,q=map(int,input().split())
if n==1:
  for i in range(q):
    Q=list(map(int,input().split()))
    if Q[0]==2:
      print(-1)
  exit()
  
query=[]
u0,v0=-1,-1
uf=UnionFind(n)
for _ in range(q):
  Q=list(map(int,input().split()))
  if Q[0]==1:
    u,v=Q[1:]
    u-=1
    v-=1
    uf.union(u,v)
    if u0==-1 and uf.grp_cnt==2:
      g=uf.all_group_members()
      for i in g:
        if u0==-1:
          u0=g[i][0]
        else:
          v0=g[i][0]
    query.append((1,u,v))
  else:
    query.append((2,Q[1]-1,-1))

if u0==-1:
  g=uf.all_group_members()
  for i in g:
    if u0==-1:
      u0=g[i][0]
    elif v0==-1:
      v0=g[i][0]
      
uf=UnionFind(n)
for t,u,v in query:
  if t==1:
    uf.union(u,v)
  else:
    if not uf.same(u,u0):
      print(u0+1)
    elif not uf.same(u,v0):
      print(v0+1)
    else:
      print(-1)