from sys import stdin
input = stdin.readline

class UnionFind:
    def __init__(self,n):
        self.n = n
        self.parent_size = [-1]*n
 
    def leader(self,a):
        if self.parent_size[a] < 0:
            return a
        self.parent_size[a] = self.leader(self.parent_size[a])
        return self.parent_size[a]
 
    def merge(self,a,b):
        x, y = self.leader(a), self.leader(b)
        if x == y:
            return 
        if abs(self.parent_size[x]) < abs(self.parent_size[y]):
            x, y = y, x
        self.parent_size[x] += self.parent_size[y]
        self.parent_size[y] = x
        return 
 
    def same(self,a,b):
        return self.leader(a) == self.leader(b)
 
    def size(self,a):
        return abs(self.parent_size[self.leader(a)])
 
    def groups(self):
        result = [[] for _ in range(self.n)]
        for i in range(self.n):
            result[self.leader(i)].append(i)
        return [r for r in result if r != []]

N, Q = map(int, input().split())
query = [list(map(int, input().split())) for _ in range(Q)]

L = set(range(N))
UF = UnionFind(N)
for q in query:
    if q[0] == 1:
        u, v = q[1:]
        u, v = u-1, v-1
        if not UF.same(u, v):
            a, b = UF.leader(u), UF.leader(v)
            L.remove(a)
            L.remove(b)
            UF.merge(u, v)
            L.add(UF.leader(u))
    else:
        v = q[1]-1
        l = UF.leader(v)
        L.remove(l)
        if 1 <= len(L):
            print(next(iter(L))+1)
        else:
            print(-1)
        L.add(l)