from sys import stdin
from collections import deque

class UnionFind():
    def __init__(self, n):
        self.N = n
        self.siz = n
        self.parent_or_size = [-1] * n
        self.stack = deque()
        self.used = deque()

    def leader(self, x):
        if self.parent_or_size[x] < 0: return x
        self.stack.append(x)
        x = self.parent_or_size[x]

        while self.parent_or_size[x] >= 0:
            self.stack.append(self.parent_or_size[x])
            x = self.parent_or_size[x]
        
        while len(self.stack):
            self.parent_or_size[self.stack.pop()] = x

        return x

    def same(self, x, y):
        return self.leader(x) == self.leader(y)

    def merge(self, x, y):
        rx, ry = self.leader(x), self.leader(y)
        if rx == ry: return
        if self.parent_or_size[rx] > self.parent_or_size[ry]: rx, ry = ry, rx
        self.parent_or_size[rx] += self.parent_or_size[ry]
        self.parent_or_size[ry] = rx
        self.siz -= 1
        self.used.append(rx)
        self.used.append(ry)
    
    def reset(self):
        self.siz = self.N
        while len(self.used): self.parent_or_size[self.used.pop()] = -1

N, Q = map(int, input().split())

is_zero = 0
uf = UnionFind(2 * N)

pow2 = [0] * (N + 1)
pow2[0] = 1
for i in range(N): pow2[i + 1] = (pow2[i] + pow2[i]) % 998244353

for _ in range(Q):
    query = list(map(int, stdin.readline().split()))
    if query[0] <= 2:
        query[1] -= 1
        query[2] -= 1
        if query[0] == 1:
            uf.merge(query[1], query[2])
            uf.merge(query[1] + N, query[2] + N)
        else:
            uf.merge(query[1], query[2] + N)
            uf.merge(query[1] + N, query[2])
        
        if uf.same(query[1], query[1] + N): is_zero = 1
    else:
        is_zero = 0
        uf.reset()

    if is_zero == 1:
        print(0)
    else:
        print(pow2[uf.siz >> 1])