#include //using namespace std; #pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++) #define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++) #define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--) #define ll long long #define ALL(a) (a).begin(),(a).end() #define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key))) #define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(ll)(key))) #define pb emplace_back #define mp std::make_pair // #define endl "\n" //using std::endl; using std::cin; using std::cout; using std::vector; using std::string; using std::upper_bound; using std::lower_bound; using vi=vector; using vii=vector; using pii=std::pair; // constexpr ll MOD=1e9+7; //constexpr ll MOD=998244353; //constexpr ll MOD=10000000; //constexpr ll MOD=1e4; constexpr ll MAX=3e6; constexpr ll inf=(1ll<<60); template class prique :public std::priority_queue, std::greater> {}; template struct Segment_tree{ ll N; T mem; vector node; Segment_tree(vector &X,T m):mem(m){ ll sz=X.size(); N=1; while(N0){ X=(X-1)/2; node[X]=Compare(node[X*2+1],node[X*2+2]); } } T Query(ll a,ll b,ll now,ll l,ll r){ //[a,b),[l,r) if(r<0) r=N; if(r<=a||b<=l) return mem; if(a<=l&&r<=b) return node[now]; auto vl=Query(a,b,now*2+1,l,(l+r)/2),vr=Query(a,b,now*2+2,(l+r)/2,r); return Compare(vl,vr); } }; template struct lazy_Segment_tree{ int N; vector node,lazy; T INF; lazy_Segment_tree(vector X,T Y):INF(Y){ N=1; while(X.size()>N) N*=2; node.resize(2*N-1,Y); lazy.resize(2*N-1); rep(i,0,X.size()) node[i+N-1]=X[i]; per(i,N-2,0) node[i]=compare(node[i*2+1],node[i*2+2]); } T compare(T X,T Y){ return std::max(X,Y); } T plus(T X,int l,int r){ return X; } void eval(int now,int l,int r){ if(lazy[now]==0) return; node[now]+=lazy[now]; if(r-l>1){ lazy[now*2+1]+=plus(lazy[now],l,r); lazy[now*2+2]+=plus(lazy[now],l,r); } lazy[now]=0; } void update(int a,int b,T add,int now=0,int l=0,int r=-1){ if(r<0) r=N; eval(now,l,r); if(b<=l||r<=a) return; if(a<=l&&r<=b){ lazy[now]+=add; eval(now,l,r); } else{ update(a,b,add,now*2+1,l,(r+l)/2); update(a,b,add,now*2+2,(r+l)/2,r); node[now]=compare(node[now*2+1],node[now*2+2]); } } T Query(int a,int b,int now=0,int l=0,int r=-1){ if(r<0) r=N; eval(now,l,r); if(b<=l||r<=a) return INF; if(a<=l&&r<=b) return node[now]; return compare(Query(a,b,now*2+1,l,(r+l)/2),Query(a,b,now*2+2,(r+l)/2,r)); } }; struct Tree{ int N; vii dp; vi dist; Tree(vii edge){ N=edge.size(); dp.resize(N); dist.resize(N,-1); for(int i=0;i que; que.push(0); while(!que.empty()){ int now=que.front(); que.pop(); for(int i=0;i=0;i--){ if(dp[X][i]!=dp[Y][i]){ X=dp[X][i]; Y=dp[Y][i]; } } return dp[X][0]; } }; struct Binary_indexed_tree{ int N; vi bit; Binary_indexed_tree(int n):N(n){ bit.resize(N+1,0); } void add(int x,ll a){ for(x;x<=N;x+=(x&-x)) bit[x]+=a; } ll sum(int x){ ll ret=0; for(x;x>0;x-=(x&-x)) ret+=bit[x]; return ret; } ll lower_bound(ll X){ if(sum(N)0){ if(memo+ret<=N&&sum+bit[memo+ret] 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } vi fac,finv,inv; void COMinit() { fac.resize(MAX); finv.resize(MAX); inv.resize(MAX); fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } ll COM(ll n,ll r){ if(n memo; rep(i,0,A.size()) memo[A[i]]=0; ll cnt=1; for(auto &p:memo) p.second=cnt++; rep(i,0,A.size()) A[i]=memo[A[i]]; } void dec(std::map &mem,ll X){ mem[X]--; if(mem[X]==0) mem.erase(X); } int main(){ std::ios::sync_with_stdio(false); std::cin.tie(nullptr); ll N,Q; cin>>N>>Q; vi par(N),sum(N),cnt(N,1); rep(i,0,N) par[i]=i; while(Q--){ ll T,A,B; cin>>T>>A>>B; if(T==1){ A--,B--; while(A!=par[A]) A=par[A]; while(B!=par[B]) B=par[B]; if(A==B) continue; if(cnt[A]