import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

class UnionFindVerSize():
    def __init__(self, N):
        self._parent = [n for n in range(0, N)]
        self._size = [1] * N
        self.group = N

    def find_root(self, x):
        if self._parent[x] == x: return x
        self._parent[x] = self.find_root(self._parent[x])
        return self._parent[x]

    def unite(self, x, y):
        gx = self.find_root(x)
        gy = self.find_root(y)
        if gx == gy: return

        self.group -= 1

        if self._size[gx] < self._size[gy]:
            self._parent[gx] = gy
            self._size[gy] += self._size[gx]
        else:
            self._parent[gy] = gx
            self._size[gx] += self._size[gy]

    def get_size(self, x):
        return self._size[self.find_root(x)]

    def is_same_group(self, x, y):
        return self.find_root(x) == self.find_root(y)


N,Q = mi()
a = 1
uf = UnionFindVerSize(N)
for _ in range(Q):
    t,*query = mi()
    if t == 1:
        u,v = query
        u,v = u-1,v-1
        uf.unite(u,v)
        while a!=N and uf.is_same_group(0,a):
            a += 1
    else:
        v = query[0]
        v -= 1
        if not uf.is_same_group(0,v):
            print(1)
        elif a!=N:
            print(a+1)
        else:
            print(-1)