from sys import stdin

class UnionFind():
    def __init__(self, n):
        self.N = n
        self.num_component = n
        self.parent_or_size = [-1] * n
        self.weight = [0] * n
        self.used_list = []
        self.is_zero = False

    def leader(self, x):
        if self.parent_or_size[x] < 0: return x
        root = self.leader(self.parent_or_size[x])
        self.weight[x] ^= self.weight[self.parent_or_size[x]]
        self.parent_or_size[x] = root
        return root
    
    def merge(self, x, y, w):
        rx, ry = self.leader(x), self.leader(y)
        w ^= self.weight[x] ^ self.weight[y]
        if rx == ry:
            if w: self.is_zero = True 
            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.weight[ry] = w
        self.num_component -= 1
        self.used_list.append(ry)
        self.used_list.append(rx)
    
    def reset(self):
        self.num_component = self.N
        self.is_zero = False
        for pos in self.used_list:
            self.parent_or_size[pos] = -1
            self.weight[pos] = 0
        self.used_list.clear()

N, Q = map(int, stdin.readline().split())

uf = UnionFind(N)
pow2 = [0] * (N + 1)
pow2[0] = 1
for i in range(N):
    pow2[i + 1] = pow2[i] + pow2[i]
    if pow2[i + 1] >= 998244353: pow2[i + 1] -= 998244353

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