#include <bits/stdc++.h>
using namespace std;
int n, m, fa[200005], siz[200005],  t[200005], ccnt, w[200005], f[200005][21], head[200005], nxt[200005], to[200005], cnt, num[200005], d[200005], ct, tt[200005];
map<pair<int, int>, int> ma;
struct node {
	int op, p, q, ans, z;
} b[300005];
inline int finds(int p) {
	return (fa[p] == p) ? p : fa[p] = finds(fa[p]);
}
inline void add(int p, int q) {
	nxt[++ccnt] = head[p];
	to[ccnt] = q;
	head[p] = ccnt;
}
inline int lowbit(int p) {
	return p & -p;
}
inline void tadd(int p, int q) {
	while (p <= cnt) {
		t[p] += q;
		p += lowbit(p);
	}
}
inline int query(int p) {
	int u = 0;
	while (p >= 1) {
		u += t[p];
		p -= lowbit(p);
	}
	return u;
}
inline void dfs(int p, int q) {

	f[p][0] = q;
	siz[p] = 1;
	tt[p] = ++ct;
	for (int i = 1; i <= 20; i++) {
		f[p][i] = f[f[p][i - 1]][i - 1];
	}
	d[p] = d[q] + 1;
	num[p] += num[q];
	for (int i = head[p]; i; i = nxt[i]) {
		dfs(to[i], p);
		siz[p] += siz[to[i]];
	}
//	cout << p << ")))))))" << q << ' ' << siz[p] << endl;
}
inline int lca(int p, int q) {
	if (p == q) return p;
	if (d[p] < d[q]) swap(p, q);
	for (int i = 20; i >= 0; i--) {
		if (d[f[p][i]] >= d[q]) p = f[p][i];
	}
	if (p == q) return p;
	for (int i = 20; i >= 0; i--) {
		if (f[p][i] != f[q][i]) {
			p = f[p][i], q = f[q][i];
		}
	}
	return f[p][0];
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	cnt = n;
	int op, p, q;
	for (int i = 1; i <= n; i++) fa[i] = i;
	for (int i = 1; i <= m; i++) {
		cin >> b[i].op;
		if (b[i].op == 1) {
			cin >> b[i].p >> b[i].q;
			ma[make_pair(b[i].p, b[i].q)]++;
			ma[make_pair(b[i].q, b[i].p)]++;
			if (finds(b[i].p) == finds(b[i].q)) continue;
			++cnt;
			add(cnt, finds(b[i].p));
			add(cnt, finds(b[i].q));
			fa[finds(b[i].p)] = fa[finds(b[i].q)] = cnt;
			fa[cnt] = cnt;
		} else if (b[i].op == 2) {
			cin >> b[i].p;
			num[finds(b[i].p)]++;
			b[i].p = finds(b[i].p);
		} else {
			cin >> b[i].p >> b[i].q;
			b[i].z = (finds(b[i].p) == finds(b[i].q));
		}
	}
	for (int i = cnt; i >= 1; i--) {
		if (!d[i]) {
			dfs(i, 0);
//			cout << i << "%%%%%%%";
		}
	}
	for (int i = m; i >= 1; i--) {
		if (b[i].op == 1) {
			ma[make_pair(b[i].p, b[i].q)]--;
			ma[make_pair(b[i].q, b[i].p)]--;
		} else if (b[i].op == 2) {
			tadd(tt[b[i].p], -1);
			tadd(tt[b[i].p] + siz[b[i].p], 1);
//			cout << tt[b[i].p] << "^^^^" << siz[b[i].p] << endl;
		} else {
			if (b[i].z == 0) {
				b[i].ans = 0;
			} else {
				int v = lca(b[i].p, b[i].q);
//				cout << v << ' ' << num[v] << ' ' << tt[v] << " " << query(tt[v]) << "[]\n";
				b[i].ans = num[v] + query(tt[v]) + ma[make_pair(b[i].p, b[i].q)];
			}
		}
	}
	for (int i = 1; i <= m; i++) {
		if (b[i].op == 3) {
			cout << b[i].ans << "\n";
		}
	}
}