#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <array>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <bitset>

#include <cmath>
#include <math.h>
#include <climits>

#pragma warning(push)
#pragma warning(disable:26498 26450 26451 26812)
#include "atcoder/all"
#pragma warning(pop)

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10)

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPI(i, init, n) for (ll i = init; i < (n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPE(i, c) for (const auto& i : c)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;

using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;

const char* YES = "Yes";
const char* NO = "No";
void yn(bool f) { std::cout << (f ? YES : NO) << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }
template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n, q;
    cin >> n >>  q;

    dsu d(n * 2);

    mint init = mint(2).pow(n);
    mint ans = init;
    mint inv2 = mint(2).inv();

    set<ll> use;
    vector<uv> uvs;

    REP(i, q) {
        ll op;
        cin >> op;

        if (op == 1 || op == 2) {
            ll u, v;
            cin >> u >>  v;
            --u; --v;

            use.insert(u);
            use.insert(v);

            uvs.push_back({ u, v, op });
        }

        if (op == 3 || i == q - 1) {
            ans = init;

            map<ll, ll> dep;
            {
                ll  xx = 0;
                for (auto& x : use) {
                    dep[x] = xx++;
                }
            }
            ll sz = dep.size();
            dsu d(sz * 2);
            
            REP(arc, uvs.size()) {
                ll u = dep[uvs[arc].u];
                ll v = dep[uvs[arc].v];
                ll opa = uvs[arc].c;

                if (u == v) {
                    if (opa != 1) {
                        d.merge(u, u + sz);
                        ans = 0;
                    }
                }
                else {
                    if (opa == 1) {
                        if (!d.same(u, v)){
                            d.merge(u, v);
                            d.merge(u + sz, v + sz);
                            ans *= inv2;
                        }
                    }
                    else {
                        if (!d.same(u, v + sz)) {
                            d.merge(u, v + sz);
                            d.merge(u + sz, v);
                            ans *= inv2;
                        }
                    }

                    if (d.same(u, u + sz) || d.same(v, v + sz)) {
                        ans = 0;
                    }
                }
                cout << ans.val() << endl;
            }

            use.clear();
            uvs.clear();
        }

        if (op == 3) {
            cout << init.val() << endl;
        }
    }
}