#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <complex>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T> &a){
  for(auto &i:a)is>>i;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
int main(){
  int n,q;
  cin>>n>>q;
  vector<vector<int>>id(n);
  rep(i,n)id[i].push_back(i);
  dsu uf(n);
  while(q--){
    int t;
    cin>>t;
    if(t==1){
      int u,v;
      cin>>u>>v;
      u--,v--;
      if(uf.same(u,v))continue;
      u=uf.leader(u),v=uf.leader(v);
      uf.merge(u,v);
      int l=uf.leader(u);
      if(l!=u)swap(u,v);
      vector<int>nxt;
      std::merge(all(id[u]),all(id[v]),back_inserter(nxt));
      swap(id[u],nxt);
    }
    else{
      int u;
      cin>>u;
      u--;
      u=uf.leader(u);
      if(id[u].size()==n){
        cout<<-1<<endl;
        continue;
      }
      if(!binary_search(all(id[u]),n-1)){
        cout<<n<<endl;
        continue;
      }
      int l=0,r=n;
      while(r-l>1){
        int mid=(l+r)/2;
        if(lower_bound(all(id[u]),mid)-id[u].begin()==mid)l=mid;
        else r=mid;
      }
      cout<<l+1<<endl;
    }
  }
}