#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct dsu{
    vector<ll> par, rank, siz;
    dsu(ll n): par(n, -1), rank(n, 0), siz(n, 1){}
    ll root(ll a){
        if(par[a] == -1) return a;
        else return par[a] = root(par[a]);
    }
    bool sch(ll a, ll b){
        return root(a) == root(b);
    }
    bool mg(ll a, ll b){
         a = root(a), b = root(b);
        if(a == b) return false;
        if(rank[a] < rank[b]) swap(a, b);
        par[b] = a;
        if(rank[a] == rank[b]) rank[a]++;
        siz[a] += siz[b];
        return true;
    }
    ll sz(ll a){
        return siz[root(a)];
    }
    vector<ll> pp(ll a){
        return par;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, q; cin >> n >> q;
    dsu uf(n);
    set<ll> st;
    for(int i = 0; i < n; i++) st.insert(i);
    for(int i = 0; i < q; i++){
        int t; cin >> t;
        if(t == 1){
            ll u, v; cin >> u >> v;
            u--, v--;
            uf.mg(u, v);
            ll uu = uf.root(u), vv = uf.root(v);
            if(st.count(uu)) st.erase(uu);
            if(st.count(vv)) st.erase(vv);
            if(st.count(u)) st.erase(u);
            if(st.count(v)) st.erase(v);
        }else{
            ll v; cin >> v;
            v--;
            ll s = uf.sz(0);
            if(s == n) cout << -1 << '\n';
            else{
                if(*begin(st) == v){
                    st.erase(v);
                    cout << *begin(st)+1 << '\n';
                    st.insert(v);
                }else  cout << *begin(st)+1 << '\n';
            }
        }
    }
    return 0;
}