#include <vector>
#include <algorithm>

namespace nachia {

struct Dsu{
private:
    int N;
    std::vector<int> P;
    std::vector<int> H;
public:
    Dsu() : N(0) {}
    Dsu(int n) : N(n), P(n, -1), H(n) {
        for(int i=0; i<n; i++) H[i] = i;
    }
    int leader(int u){
        if(P[u] < 0) return u;
        int v = P[u];
        while(P[v] >= 0){ P[u] = P[v]; u = v; v = P[v]; }
        return P[u];
    }
    int append(){
        int n = P.size();
        P.push_back(-1);
        H.push_back(n);
        return n;
    }
    int label(int u){ return H[leader(u)]; }
    int operator[](int u){ return H[leader(u)]; }
    void merge(int u, int v, int newLabel){
        if(newLabel < 0) newLabel = u;
        u = leader(u);
        v = leader(v);
        if(u == v){ H[u] = newLabel; return; }
        N--;
        if(-P[u] < -P[v]) std::swap(u, v);
        P[u] += P[v];
        H[P[v] = u] = newLabel;
    }
    int merge(int u, int v){ merge(u, v, u); return u; }
    int count(){ return N; }
    int size(int u){ return -P[leader(u)]; }
    bool same(int u, int v){ return leader(u) == leader(v); }
};

} // namespace nachia



#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

int main(){
    set<int> ls;
    int N; cin >> N;
    nachia::Dsu dsu(N);
    rep(i,N) ls.insert(i);
    int Q; cin >> Q;
    rep(i,Q){
        int t; cin >> t;
        if(t == 1){
            int u,v; cin >> u >> v; u--; v--;
            if(dsu.same(u,v)) continue;
            ls.erase(dsu[v]);
            ls.erase(dsu[u]);
            ls.insert(u);
            dsu.merge(u, v, u);
        }
        else{
            int v; cin >> v; v--;
            if(ls.size() == 1){
                cout << "-1\n";
            }
            else{
                auto it = ls.find(dsu[v]);
                if(it == ls.begin()){
                    it++;
                    cout << ((*it) + 1) << '\n';
                }
                else{
                    it--;
                    cout << ((*it) + 1) << '\n';
                }
            }
        }
    }
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;