from sys import stdin
input=lambda :stdin.readline()[:-1]

from collections import defaultdict

class UnionFind():
  def __init__(self,n):
    self.n=n
    self.parents=[-1]*n
    self.res=[]

  def find(self,x):
    if self.parents[x]<0:
      return x
    else:
      self.parents[x]=self.find(self.parents[x])
      return self.parents[x]

  def clear(self):
    for i in self.res:
      self.parents[i]=-1
    self.res=[]
    
  def union(self,x,y):
    x=self.find(x)
    y=self.find(y)

    self.res.append(x)
    self.res.append(y)
    
    if x==y:
      return

    if self.parents[x]>self.parents[y]:
      x,y=y,x

    self.parents[x]+=self.parents[y]
    self.parents[y]=x

  def size(self,x):
    return -self.parents[self.find(x)]

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

  def members(self,x):
    root=self.find(x)
    return [i for i in range(self.n) if self.find(i)==root]

  def roots(self):
    return [i for i, x in enumerate(self.parents) if x< 0]

  def group_count(self):
    return len(self.roots())

  def all_group_members(self):
    group_members=defaultdict(list)
    for member in range(self.n):
      group_members[self.find(member)].append(member)
    return group_members


mod=998244353
n,q=map(int,input().split())
pow2=[1]*(n+1)
for i in range(n):
  pow2[i+1]=pow2[i]*2%mod

free=n
flag=True
uf=UnionFind(2*n)
for i in range(q):
  query=list(map(lambda x:int(x)-1,input().split()))
  if query[0]==1:
    x,y=query[1:]
    if not uf.same(2*x,2*y+1):
      uf.union(2*x,2*y+1)
      uf.union(2*x+1,2*y)
      free-=1
    if uf.same(2*x,2*x+1):
      flag=False
    if uf.same(2*y,2*y+1):
      flag=False
  elif query[0]==0:
    x,y=query[1:]
    if not uf.same(2*x,2*y):
      uf.union(2*x,2*y)
      uf.union(2*x+1,2*y+1)
      free-=1
    if uf.same(2*x,2*x+1):
      flag=False
    if uf.same(2*y,2*y+1):
      flag=False
  else:
    uf.clear()
    free=n
    flag=True
  
  if flag:
    print(pow2[free])
  else:
    print(0)
  #print(uf.all_group_members())