N,Q = map(int,input().split())
P = [-1] * (N+1)
Ps = set(range(1,N+1))

def root(x):
    if P[x] < 0: return x
    P[x] = root(P[x])  # 経路圧縮
    return P[x]

def unite(x,y):
    x = root(x)
    y = root(y)
    if x == y: return
    if x > y: x,y = y,x
    P[x] += P[y]
    P[y] = x
    Ps.remove(y)

def same(x,y):
    return root(x) == root(y)

for _ in range(Q):
    qu = list(map(int,input().split()))
    if qu[0] == 1:
        unite(qu[1],qu[2])
    else:
        if len(Ps) == 1:
            print(-1)
        else:
            for p in Ps:
                if not same(p,qu[1]):
                    print(p)
                    break