#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define ll long long
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define vc vector
void solve()
{
    int n, q;
    cin >> n >> q;
    dsu d(n);
    unordered_set<int> t(n);
    rep(i, n) t.insert(i);
    rep(i, q)
    {
        int ty;
        cin >> ty;
        if (ty == 1)
        {
            int u, v;
            cin >> u >> v;
            u--, v--;
            u = d.leader(u);
            v = d.leader(v);
            if (u == v)
                continue;
            d.merge(u, v);
            int x = d.leader(u);
            if (u == x)
                t.erase(v);
            else
                t.erase(u);
        }
        else
        {
            int u;
            cin >> u;
            u--;
            u = d.leader(u);
            int ans = -1;
            for (int j : t)
            {
                if (u != j)
                {
                    ans = j + 1;
                    break;
                }
            }
            cout << ans << '\n';
        }
    }
    return;
}
int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(13);
    int t = 1;
    // cin >> t;
    rep(i, t) solve();
    return 0;
}