import sys
input = sys.stdin.readline


def main():
    N, Q = map(int, input().split())
    uf = UnionFind(N)
    ans = []
    for _ in range(Q):
        query = list(map(int, input().split()))
        if query[0] == 1:
            u, v = query[1:]
            u, v = u - 1, v - 1
            uf.union(u, v)
        else:
            v = query[1] - 1
            ans.append(uf.ans(v))
    print(*ans, sep='\n')


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

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

    def union(self, x, y):
        x, y = self.find(x), self.find(y)
        if x == y:
            return
        if self.parent[y] < self.parent[x]:
            x, y = y, x
        self.parent[x] += self.parent[y]
        self.parent[y] = x
        self.parents.discard(y)

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

    def ans(self, y):
        x = self.find(y)
        for p in self.parents:
            if x != p:
                return p + 1
        return -1


main()