#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x&(-x)
#define int long long
unordered_map<int,vector<int> >mp;
int n,m;int nw ;
vector<int>p[400005];
vector<int>tag[400005];
vector<pair<pair<int,int>,int> >query;
vector<int>q[400005];
int lca[300005][20],dep[300005],fa[400005],rt[400005],vis[300005],ans[300005];
int tree[400005];
void upd(int pos,int add){
	for(int i = pos;i<400000;i+=lowbit(i))tree[i]+=add;return;
}int queryy(int pos){int res =0 ;
	for(int i = pos;i>0;i-=lowbit(i))res+=tree[i];
	return res;
}
int find(int x){
	if(fa[x] == x)return x;
	return fa[x] = find(fa[x]);
}void merge(int x,int y){
	int a = find(x),b=  find(y);
	if(a==b)return;
	int nd = ++nw;
	p[rt[a]].push_back(nd),p[nd].push_back(rt[a]);
	p[rt[b]].push_back(nd),p[nd].push_back(rt[b]);
//	cout << a << "  " << b << "  " << nd << endl;
	rt[b] = nd;fa[a] = b;
	return;
}void dfs(int now,int f){vis[now] = 1;
	dep[now] = dep[f]+1;lca[now][0] = f;
	for(int i = 1;i<18;i++)lca[now][i] = lca[lca[now][i-1]][i-1];
	for(int i = 0;i<p[now].size();i++){
		if(p[now][i] == f)continue;
		dfs(p[now][i],now);
	}
}int lcaa(int x,int y){
	if(dep[x]<dep[y])swap(x,y);
	//if(rt[find(x)]!=rt[find(y)])return 0;
	int dis = abs(dep[x]-dep[y]);
	for(int i =0;dis;i++,dis>>=1){
		if(dis&1)x = lca[x][i];
	}
	if(x == y)return x;
	for(int i = 17;i>=0;i--){
		if(lca[x][i]!=lca[y][i]){
			x = lca[x][i],y = lca[y][i];
		}
	}if(lca[x][0]!=lca[y][0])return 0;
	return lca[x][0];
}void dfs2(int now,int f){vis[now] = 1;
	for(int i = 0;i<tag[now].size();i++){
		upd(tag[now][i],1);
	}for(int i = 0;i<q[now].size();i++){
		ans[q[now][i]] += queryy(q[now][i]-1);
	}for(int i =0;i<p[now].size();i++){
		if(p[now][i] == f)continue;
		dfs2(p[now][i],now);
	}for(int i =0;i<tag[now].size();i++){
		upd(tag[now][i],-1);
	}
} 
signed main(){
	ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
	memset(ans,-1,sizeof(ans));
	cin >> n >> m;nw = n;
	for(int i= 1;i<=n;i++)fa[i] = i,rt[i] = i;
	for(int i = 1;i<=m;i++){
		int op;cin >> op;
		if(op == 1){
			int x,y;cin >> x >> y;
			if(x>y)swap(x,y);
		//	cout <<  "     " << x << " " << y << endl;
			mp[x*n+y].push_back(i);merge(x,y);
		}if(op == 2){
			int x;cin >> x;
			tag[rt[find(x)]].push_back(i);
		//	cout << " " << x << " "<< rt[find(x)] << " " << i << endl;
		}if(op == 3){
			int x,y;cin >>x  >> y;
			if(x>y)swap(x,y);
			query.push_back({{x,y},i});
		}
	}for(int i =nw;i>=1;i--){
		if(!vis[i])dfs(i,i);
	}//cout << 1 << endl;
//	cout << "   " << mp[{10,10}] << endl;
	for(int i =0;i<query.size();i++){
		int x = query[i].first.first,y = query[i].first.second,t = query[i].second;
		int l = lcaa(x,y);
	//	cout  << "  "<< x << " " << y << " " << l << endl;mp[x*n+y].push_back((n+1)*(n+1));
		q[l].push_back(t);ans[t] = lower_bound(mp[x*n+y].begin(),mp[x*n+y].end(),t)-mp[x*n+y].begin();
	//	cout << ans[t] << endl;
	}memset(vis,0,sizeof(vis));
	//cout << 11 << endl;
	for(int i = nw;i>=1;i--){
		if(!vis[i])dfs2(i,i);
	}for(int i = 1;i<=m;i++){
		if(ans[i]!=-1)cout << ans[i] << '\n';
	}
	return 0;
}/*
8 10
1 3 6
2 6
2 2
2 7
1 7 3
3 2 6
1 4 2
3 3 7
1 2 6
2 4
*/