#include #include using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; using mint = modint998244353; const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, q; cin >> n >> q; vectort(q), u(q), v(q); rep(i, q) { cin >> t[i]; if (t[i] <= 2) { cin >> u[i] >> v[i]; u[i]--, v[i]--; } } int l = 0; for (; l < q;) { int r = l + 1; while ((r < q) && (3 != t[r])) { r++; } //cout << l << " " << r << endl; mapmp; for (int i = l; i < r; ++i) { if (3 == t[i])continue; if (!mp.count(u[i])) mp[u[i]] = mp.size(); if (!mp.count(v[i])) mp[v[i]] = mp.size(); } int sz = mp.size(); //cout << sz << endl; dsu uf(sz * 2); bool chk = true; for (int i = l; i < r; ++i) { if (1 == t[i]) { int x0 = mp[u[i]] * 2; int x1 = x0 + 1; int y0 = mp[v[i]] * 2; int y1 = y0 + 1; if (uf.same(x0, y1) || uf.same(x1, y0)) { chk = false; } else { uf.merge(x0, y0); uf.merge(x1, y1); } } else if (2 == t[i]) { int x0 = mp[u[i]] * 2; int x1 = x0 + 1; int y0 = mp[v[i]] * 2; int y1 = y0 + 1; if (uf.same(x0, y0) || uf.same(x1, y1)) { chk = false; } else { uf.merge(x0, y1); uf.merge(x1, y0); } } if (!chk) { cout << 0 << endl; continue; } auto g = uf.groups(); mint ans = pow_mod(2, n - sz + g.size() / 2, mod); cout << ans.val() << endl; } l = r; } return 0; }