#yukicoder2290 UnUnion Find

#UnionFind
class UnionFind:
    def __init__(self,N): self._parent=[-1 for i in[0]*N]; self._Plist=set([i for i in range(N)])
    def find(self,v):  #頂点vの親を探し、経路圧縮する
        vertices=[]
        while self._parent[v]>=0: vertices.append(v);v=self._parent[v]
        for i in vertices: self._parent[i]=v
        return v
    def unite(self,x,y):  #頂点xとyを併合し、併合の有無を返す
        x,y = self.find(x),self.find(y)
        if x==y: return 0
        if self._parent[x]>self._parent[y]: x,y=y,x  #負値で管理
        self._parent[x]+=self._parent[y]; self._parent[y]=x
        self._Plist.discard(y); return 1
    def same(self,x,y):return self.find(x)==self.find(y)   #xとyは同一集合か返す
    def size(self,x):  return -self._parent[self.find(x)]  #xの集合のサイズを求める
    def check(self): return self._Plist


f=lambda:list(map(int,input().split()))
N,Q=f(); UF=UnionFind(N)
for _ in range(Q):
    t,u,*v=f(); u-=1
    if t==1: v=v[0]-1; UF.unite(u,v)
    if t==2:
        x=UF.check(); u=UF.find(u)
        if len(x)==1: print(-1); continue
        for i in x:
            if i!=u: print(i+1); break