#include //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); //clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC< pii; typedef pair ppii; typedef pair pipi; typedef pair pll; typedef pair ppll; typedef pair plpl; typedef pair P; typedef tuple tl; typedef pair pdd; typedef vector> mat; ll mod=1000000007; ll mod2=998244353; ll mod3=1000003; ll mod4=998244853; ll mod5=1000000009; ll inf=1LL<<62; int iinf=1<<30; double pi=3.141592653589793238462643383279L; double eps=1e-14; #define rep(i,m,n) for(ll i=m;i=m;i--) #define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++) #define mrep(itr,mp) for(auto& itr:mp) #define Max(a,b) a=max(a,b) #define Min(a,b) a=min(a,b) int dh[4]={1,-1,0,0}; int dw[4]={0,0,1,-1}; int ddh[8]={-1,-1,-1,0,0,1,1,1}; int ddw[8]={-1,0,1,-1,1,-1,0,1}; struct custom_hash { static uint64_t splitmix64(uint64_t x) { // http://xorshift.di.unimi.it/splitmix64.c x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; #define umh unordered_map ll gcd(ll a,ll b){ if(a0){ if(k&1)ret*=now; now*=now; k/=2; } return ret; } ll beki(ll n,ll k,ll md){ ll ret=1; ll now=n; now%=md; while(k>0){ if(k%2==1){ ret*=now; ret%=md; } now*=now; now%=md; k/=2; } return ret; } ll gyaku(ll n,ll md){ return beki(n,md-2,md); } ll poc(ll n){ ll ret=0; ll u=n; while(u>0){ ret+=u%2; u/=2; } return ret; } struct UF{ private: vector par,len,you,wa,ans; set st[500010]; public: UF(int n){ rep(i,0,n){ par.push_back(i); len.push_back(0); you.push_back(1); wa.push_back(0); ans.push_back(0); st[i].insert(i); } } int root(int n){ if(par[n]==n)return n; else return par[n]=root(par[n]); } void unit(int a,int b){ a=root(a); b=root(b); if(a==b)return; if(len[a]st[b].size())swap(st[a],st[b]); srep(itr,st[a])st[b].insert(*itr); } else{ par[b]=a; you[a]+=you[b]; if(len[a]==len[b])len[a]++; srep(itr,st[b]){ int now=*itr; ans[now]+=wa[b]-wa[a]; } if(st[b].size()>st[a].size())swap(st[a],st[b]); srep(itr,st[b])st[a].insert(*itr); } } int yo(int a){ a=root(a); return you[a]; } void add(int n,int x){ n=root(n); wa[n]+=x; } void so(int n){ cout<>n>>q; UF uf(n); rep(i,0,q){ int t,a,b;cin>>t>>a>>b; if(t==1){ a--; b--; uf.unit(a,b); } else if(t==2){ a--; uf.add(a,b); } else{ a--; uf.so(a); } } }