class Unionfind:
     
    def __init__(self,n):
        self.uf = [-1]*n
        self.ps = set([i for i in range(n)])
    def find(self,x):
        if self.uf[x] < 0:
            return x
        else:
            self.uf[x] = self.find(self.uf[x])
            return self.uf[x]
 
    def same(self,x,y):
        return self.find(x) == self.find(y)
 
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        bx,by = x,y
        if x == y:
            return False
        if self.uf[x] > self.uf[y]:
            x,y = y,x
        self.uf[x] += self.uf[y]

        self.uf[y] = x
        if bx != x:
            self.ps.remove(bx)
        if by != x:
            self.ps.remove(by)
        return True
 
    def size(self,x):
        x = self.find(x)
        return -self.uf[x]



n,q = map(int,input().split())
uf = Unionfind(n)
for i in range(q):
    l = list(map(int,input().split()))
    if l[0] == 1:
        u,v = l[1:]
        uf.union(u-1,v-1)
    else:
        u = l[1]
        p = uf.find(u-1)
        ans = -1
        for x in uf.ps:
            if x != p:
                ans = x+1
                break
        print(ans)