#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)];
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, q; cin >> n >> q;
    dsu uf(n);
    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);
        }else{
            ll v; cin >> v;
            v--;
            bool b = true;
            for(ll j = 0; j < n; j++){
                if(!uf.sch(v, j)){
                    cout << j+1 << '\n';
                    b = false;
                    break;
                }
            }
            if(b) cout << -1 << '\n'; 
        }
    }
    return 0;
}