from collections import defaultdict
 # UnionFind(n) n:頂点数
 # parents:i番目の点が属する根 それ自身が根なら-1
 # find(x):xの属する根を再帰的に求める
 # unite(x,y):多い木に小さい木を結合
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * 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
    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
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

N,Q = map(int, input().split())
uf = UnionFind(N)
roots = set(range(N))
for q in range(Q):
    L = list(map(int, input().split()))
    if L[0] == 1:
        uf.union(L[1]-1, L[2]-1)
        roots.discard(uf.find(L[1]-1))
    else:
        ret = -1
        for r in roots:
            if not uf.same(r, L[1]-1):
                ret = r+1
                break
        print(ret)