// Problem: No.2290 UnUnion Find No.2290 联合查找
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2290
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define dbg(x) cout << #x << " = " << (x) << "\n";
#define popcount(x) __builtin_popcountll((x))
#define all(v) (v).begin(), (v).end()
#define pb emplace_back
#define x first
#define y second

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;

const int N = 2e5 + 7;
int nxt[N];

class dsu {
 private:
  vector<int> fa, sz, dis;

 public:
  void build(int N) {
    fa.resize(N + 1);
    sz.resize(N + 1);
    dis.resize(N + 1);
    for (int i = 0; i <= N; ++i) {
      fa[i] = i;
      sz[i] = 1;
      nxt[i] = i + 1;
    }
  }
  int find(int x) {
    if (fa[x] == x) return x;
    int root = find(fa[x]);
    dis[x] += dis[fa[x]];
    nxt[x] = nxt[root];
    return fa[x] = root;
  }
  void join(int x, int y) {
    x = find(x), y = find(y);
    if (x != y) {
      fa[x] = y;
      sz[y] += sz[x];
      nxt[x] = nxt[y];
    }
  }
  int size(int i) { return sz[find(i)]; }
  bool same(int x, int y) { return find(x) == find(y); }
};

void solve() {
  int n, q;
  cin >> n >> q;
  dsu d;
  d.build(n);
  for (int i = 1; i <= q; i++) {
    int op;
    cin >> op;
    if (op == 1) {
      int x, y;
      cin >> x >> y;
      d.join(x, y);
    } else {
      int x;
      cin >> x;
      int cur = 1;
      while (cur <= n && d.same(cur, x)) {
        cur = nxt[cur];
      }
      if (cur == n + 1) cur = -1;
      cout << cur << "\n";
    }
  }
}

int main() {
  fastio;
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}