#include <bits/stdc++.h>
using namespace std;

struct dsu {
    public:
    int left_leader, right_leader;
    std::vector<bool> not_leader;
    dsu() : _n(0) {}
    dsu(int n) : left_leader(0), right_leader(n - 1), _n(n), parent_or_size(n, -1), not_leader(n, false) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        not_leader[y] = true;
        while(not_leader[right_leader]) right_leader--;
        while(not_leader[left_leader]) left_leader++;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

    private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

int main(){
    int N, Q, cmd, u, v;
    cin >> N >> Q;
    dsu uf(N);
    while(Q--){
        cin >> cmd;
        if(cmd == 1){
            cin >> u >> v;
            uf.merge(--u, --v);
        }else{
            cin >> v;
            if(uf.size(0) == N){
                cout << -1 << '\n';
                continue;
            }
            v--;
            cout << (uf.same(uf.left_leader, v) ? uf.right_leader : uf.left_leader) + 1 << '\n';
        }
    }
}