## https://yukicoder.me/problems/no/2290


class UnionFind:
    """
    UnionFindの基本的な処理を実装したクラス
    """

    def __init__(self, size):
        self.root = [i for i in range(size)]
        self.size = [1] * size

    def get_root(self, v):
        if v == self.root[v]:
            return v
        else:
            old_root = self.root[v]
            new_root = self.get_root(old_root)
            self.root[v] = new_root
            return new_root

    def merge(self, u, v):
        root_u = self.get_root(u)
        root_v = self.get_root(v)
        if root_u == root_v:
            return False

        if self.size[root_u] >= self.size[root_v]:
            self.size[root_u] += self.size[root_v]
            self.root[root_v] = root_u
            self.root[v] = root_u
        else:
            self.size[root_v] += self.size[root_u]
            self.root[root_u] = root_v
            self.root[u] = root_v
        return True
    

def main():
    N, Q = map(int, input().split())
    queries = []
    for _ in range(Q):
        values = tuple(map(int, input().split()))
        queries.append(values)

    uf = UnionFind(N)
    root_set = {i for i in range(N)}
    for values in queries:
        if values[0] == 1:
            _, u, v = values
            u -= 1
            v -= 1
            root_u = uf.get_root(u)
            root_v = uf.get_root(v)
            if uf.merge(u, v):
                if root_u == uf.get_root(u):
                    root_set.remove(root_v)
                else:
                    root_set.remove(root_u)
        else:
            _, v = values
            v -= 1
            root_v = uf.get_root(v)

            found = False
            for x in root_set:
                if x != root_v:
                    print(x + 1)
                    found = True
                    break
            if not found:
                print(-1)




if __name__ == "__main__":
    main()