#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll t = 1,n,m,k,q,l,r,a,b,c,u,v,x,y,z,id[200009],o;
string s;
struct st{ll x,y; /*bool operator < (const st &a) const{return x < a.x;};*/};
bool cmp(const st &a,const st &b){return a.x < b.x;}
inline ll read(){
	ll s = 0,w = 1;
	char ch = getchar();
	while (ch > '9' || ch < '0'){ if (ch == '-') w = -1; ch = getchar();}
	while (ch <= '9' && ch >= '0') s = (s << 1) + (s << 3) + (ch ^ 48),ch = getchar();
	return s * w;
}
ll qp(ll x,ll y){
	ll a = 1,b = x;
	while (y){
		if (y & 1) a = a * b % mod;
		b = b * b % mod,y >>= 1;
	}
	return a;
}
ll find(ll x){return x == id[x] ? x : id[x] = find(id[x]);}
int main(){//t = read();
while (t --){
	set <ll> s;
	n = read(),q = read();
	for (ll i = 1;i <= n;i += 1) id[i] = i,s.insert(i);
	for (ll i = 1;i <= q;i += 1){
		o = read();
		if (o == 1){
			x = read(),y = read();
			ll qwq = find(x),awa = find(y);
			if (qwq == awa) continue;
			s.erase(awa),id[awa] = qwq;
		}
		else{
			x = read();
			if (s.size() == 1) puts("-1");
			else{
				ll qwq = *s.begin();
				if (find(qwq) == find(x)){
					ll awa = *(++ s.begin());
					printf("%lld\n",awa);
				}
				else printf("%lld\n",qwq);
			}
		}
	}
}
	return 0;
}