import sys



def main():
    input = sys.stdin.readline
    n, q = map(int, input().split())
    uf = [-1] * n
    leaders = set(range(n))

    def find(x):
        nonlocal uf
        y = x
        while uf[x] >= 0: x = uf[x]
        while uf[y] >= 0:
            z = uf[y]
            uf[y] = x
            y = z
        return x

    def union(x, y):
        nonlocal uf, leaders
        x, y = find(x), find(y)
        if x == y: return False
        if uf[x] > uf[y]: x, y = y, x
        uf[x] += uf[y]
        uf[y] = x
        leaders.remove(y)
        return True

    ans = []
    tmp = None
    for i in range(q):
        t, *x = map(int, input().split())
        if t == 1:
            a, b = x
            union(a - 1, b - 1)
        else:
            a = x[0] - 1
            a = find(a)
            if len(leaders) == 1:
                ans.append(-1)
            else:
                b = leaders.pop()
                if b == a:
                    tmp = b
                    b = leaders.pop()
                ans.append(b + 1)
                leaders.add(b)
                if tmp is not None:
                    leaders.add(tmp)
                    tmp = None
    print('\n'.join(map(str, ans)))




if __name__ == '__main__':
    main()