#include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <list>
#include <string>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <numeric>
#include <vector>
#include <climits>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}
template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;

int main() {
    int n, q;
    cin >> n >> q;
    dsu d(n);
    set<int> leader;
    rep(i, n) leader.insert(i);
    while(q--) {
        int num;
        cin >> num;
        if(num == 1) {
            int u, v;
            cin >> u >> v;
            u--, v--;
            int p_u = d.leader(u);
            int p_v = d.leader(v);
            d.merge(u, v);
            if(d.leader(u) != p_u) leader.erase(p_u);
            if(d.leader(u) != p_v) leader.erase(p_v);
        }else {
            int v;
            cin >> v;
            v--;
            if(leader.size() == 1) {
                cout << -1 << endl;
            }else{
                auto itr = leader.end();
                itr--;
                if(*itr != d.leader(v)) {
                    cout << (*itr) + 1 << endl;
                }else{
                    cout << (*leader.begin()) + 1 << endl;
                }
            }
        }
    }
    return 0;
}