#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
ll t = 1,n,m,k,q,l,r,a,b,c,u,v,x,y,z,sz,cnt,o,fl,pw[400009],id[400009];
string s;
struct st{ll x,y; /*bool operator < (const st &a) const{return x < a.x;};*/};
vector <st> del;
bool cmp(const st &a,const st &b){return a.x < b.x;}
inline ll read(){
	ll s = 0,w = 1;
	char ch = getchar();
	while (ch > '9' || ch < '0'){ if (ch == '-') w = -1; ch = getchar();}
	while (ch <= '9' && ch >= '0') s = (s << 1) + (s << 3) + (ch ^ 48),ch = getchar();
	return s * w;
}
ll qp(ll x,ll y){
	ll a = 1,b = x;
	while (y){
		if (y & 1) a = a * b % mod;
		b = b * b % mod,y >>= 1;
	}
	return a;
}
ll find(ll x){
	if (x == id[x]) return x;
	ll qwq = find(id[x]);
	del.emplace_back((st){x,id[x]}),id[x] = qwq;
	return qwq;
}
void merge(ll x,ll y){
	ll qwq = find(x),awa = find(y);
	if (qwq == awa) return;
	sz -= 1;
	del.emplace_back((st){qwq,id[qwq]}),id[qwq] = awa;
	if (x > n) x -= n;
	if (y > n) y -= n;
	if (find(x) == find(x + n)) fl = 1;
	if (find(y) == find(y + n)) fl = 1;
}
void clear(){
	while (del.size()) id[del.back().x] = del.back().y,del.pop_back();
	sz = 2 * n,fl = 0;
}
int main(){//t = read();
while (t --){
	pw[0] = 1;
	n = read(),q = read(),sz = 2 * n;
	for (ll i = 1;i <= n;i += 1) pw[i] = (pw[i - 1] << 1) % mod;
	for (ll i = 1;i <= 2 * n;i += 1) id[i] = i;
	for (ll i = 1;i <= q;i += 1){
		o = read();
		if (o == 1) x = read(),y = read(),merge(x,y),merge(x + n,y + n);
		if (o == 2) x = read(),y = read(),merge(x,y + n),merge(x + n,y);
		if (o == 3) clear();
		if (fl) puts("0");
		else printf("%lld\n",pw[sz >> 1]);
	}
}
	return 0;
}