#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#define private public
#include<atcoder/all>
#undef private
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  dsu d(2 * n);
  const mint two2n = mint(2).pow(n);
  mint ans = two2n;
  const mint inv2 = mint(2).inv();
  VI used;
  while(q--) {
    int t;
    cin >> t;
    if (t <= 2) {
      int u, v;
      cin >> u >> v;
      u--, v--;
      used.emplace_back(u);
      used.emplace_back(v);
      if (t == 1 && !d.same(u, v)) {
        d.merge(u, v);
        d.merge(u + n, v + n);
        if (d.same(u, u + n)) ans = 0;
        else ans *= inv2;
      } else if (t == 2 && !d.same(u, v + n)) {
        d.merge(u, v + n);
        d.merge(u + n, v);
        if (d.same(u, u + n)) ans = 0;
        else ans *= inv2;
      }
    } else {
      ans = two2n;
      while(used.size()) {
        int v = used.back(); used.pop_back();
        d.parent_or_size[v] = -1;
        d.parent_or_size[v + n] = -1;
      }
    }
    cout << ans.val() << '\n';
  }
}