#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <stack>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, q; cin >> n >> q;
    vector<int> data(n, -1);
    vector<int> parity(n);
    vector<vector<int>> components(n);
    for(int i = 0; i < n; i++) components[i].push_back(i);
    function<int(int)> root = [&](int x) {
        return data[x] < 0 ? x : root(data[x]);
    };
    function<int(int)> size = [&](int x) {
        return -data[root(x)];
    };
    auto unite = [&](int x, int y) {
        x = root(x); y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y]; data[y] = x;
            for(int v: components[y]){
                components[x].push_back(v);
            }
            components[y].clear();
        }
        return x != y;
    };
    auto same = [&](int x, int y) {
        return root(x) == root(y);
    };
    mint ans = mint(2).pow(n);
    vector<int> buf;
    auto clear = [&](){
        for(int v: buf){
            parity[v] = 0;
            data[v] = -1;
            components[v] = {v};
        }
        ans = mint(2).pow(n);
        buf.clear();
    };
    while(q--){
        int t; cin >> t;
        if(t == 1 || t == 2){
            int p = t-1;
            int u, v; cin >> u >> v; u--; v--;
            if(same(u, v)){
                if((parity[u]^p) != parity[v]){
                    ans = 0;
                }
            }else{
                int us = size(u), vs = size(v);
                if(us > vs) swap(us, vs);
                if((parity[u]^p) != parity[v]){
                    int ur = root(u);
                    for(int x: components[ur]) parity[x] ^= 1;
                }
                ans /= 2;
                unite(u, v);
            }
            buf.push_back(u);
            buf.push_back(v);
        }else{
            clear();
        }
        cout << ans << endl;
    }
}