import sys,random,bisect from collections import deque,defaultdict from heapq import heapify,heappop,heappush from itertools import permutations from math import gcd,log input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) class UnionFindVerSize(): def __init__(self, N): self._parent = [n for n in range(0, N)] self._size = [1] * N self.group = N def find_root(self, x): if self._parent[x] == x: return x self._parent[x] = self.find_root(self._parent[x]) return self._parent[x] def unite(self, x, y): gx = self.find_root(x) gy = self.find_root(y) if gx == gy: return self.group -= 1 if self._size[gx] < self._size[gy]: self._parent[gx] = gy self._size[gy] += self._size[gx] else: self._parent[gy] = gx self._size[gx] += self._size[gy] def get_size(self, x): return self._size[self.find_root(x)] def is_same_group(self, x, y): return self.find_root(x) == self.find_root(y) class WeightedUnionFind(): def __init__(self,N): self.n = N self.parent = [i for i in range(N)] self.size = [1 for i in range(N)] self.val = [0 for i in range(N)] self.flag = True self.edge = [[] for i in range(N)] self.change = [] self.free = N def dfs(self,v,pv): stack = [(v,pv)] new_parent = self.parent[pv] while stack: v,pv = stack.pop() self.parent[v] = new_parent for nv,w in self.edge[v]: if nv!=pv: self.val[nv] = self.val[v] ^ w stack.append((nv,v)) def unite(self,x,y,w): self.change.append(x) self.change.append(y) if not self.flag: return if self.parent[x]==self.parent[y]: self.flag &= (self.val[x] ^ self.val[y] == w) return self.free -= 1 if self.size[self.parent[x]]>self.size[self.parent[y]]: self.edge[x].append((y,w)) self.edge[y].append((x,w)) self.size[x] += self.size[y] self.val[y] = self.val[x] ^ w self.dfs(y,x) else: self.edge[x].append((y,w)) self.edge[y].append((x,w)) self.size[y] += self.size[x] self.val[x] = self.val[y] ^ w self.dfs(x,y) def reset(self): self.flag = True self.free = self.n for x in self.change: self.parent[x] = x self.size[x] = 1 self.val[x] = 0 self.edge[x] = [] self.change = [] N,Q = mi() uf = WeightedUnionFind(N) for _ in range(Q): t,*query = mi() if t == 1: u,v = query u,v = u-1,v-1 if u!=v: uf.unite(u,v,1) elif t == 2: u,v = query u,v = u-1,v-1 if u!=v: uf.unite(u,v,0) else: uf.reset() if uf.flag: print(pow(2,uf.free,998244353)) else: print(0)