#include using namespace std; //#pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={1,0,-1,0,1,1,-1,-1}; const ll dx[8]={0,1,0,-1,1,-1,1,-1}; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } struct UnionFindUndo { vector par; stack> history; UnionFindUndo(int n) : par(n, -1) {} int root(int x) { if (par[x] < 0) return x; else return root(par[x]); } bool same(int x, int y) { return root(x) == root(y); } bool merge(int x, int y) { x = root(x); y = root(y); history.emplace(x,par[x]); history.emplace(y,par[y]); if (x == y) { return false; } if (par[x] > par[y]) swap(x, y); par[x] += par[y]; par[y] = x; return true; } int size(int x) { return -par[root(x)]; } void undo(){ par[history.top().first]=history.top().second; history.pop(); par[history.top().first]=history.top().second; history.pop(); } void snapshot(){ while(history.size())history.pop(); } void rollback(){ while(history.size())undo(); } }; const int mod = MOD9; const int max_n = 200005; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } bool operator==(const mint &p) const { return x == p.x; } bool operator!=(const mint &p) const { return x != p.x; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} using vm=vector; using vvm=vector; struct combination { vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } }comb(max_n); int main(){ ll n,q;cin >> n >> q; UnionFindUndo uf(n*2); ll cnt=n; rep(_,q){ ll t;cin >> t; if(t==1){ ll u,v;cin >> u >> v;u--;v--; if(!uf.same(u,v)){ cnt--; } uf.merge(u,v); uf.merge(u+n,v+n); if(uf.same(u,u+n)){ cout << 0 << endl; } else { cout << mint(2).pow(cnt) << endl; } } else if(t==2){ ll u,v;cin >> u >> v;u--;v--; if(!uf.same(u,v)){ cnt--; } uf.merge(u,v+n); uf.merge(u+n,v); if(uf.same(u,u+n)){ cout << 0 << endl; } else { cout << mint(2).pow(cnt) << endl; } } else { uf.rollback(); cout << mint(2).pow(n) << endl; cnt=n; } } }