N, Q = map(int, input().split())
Leaders = set(range(N))
Par = [i for i in range(N)]
Children = [[i] for i in range(N)]
for _ in range(Q):
    query = list(map(int, input().split()))
    if(query[0] == 1):
        u, v = query[1] - 1, query[2] - 1
        pu, pv = Par[u], Par[v]
        if(len(Children[pu]) < len(Children[pv])):
            pv, pu = pu, pv
        #pvの方が小さい
        for x in Children[pv]:
            Children[pu].append(x)
            Par[x] = pu
        Leaders.remove(pv)
    else:
        v = query[1] - 1
        if(len(Leaders) == 1):
            print(-1)
        else:
            for x in Leaders:
                if(x != Par[v]):
                    print(x + 1)
                    break