import numpy as np class SegmentTree: def __init__(self, n, e): n2 = 1 while n2 < n: n2 *= 2 self.n = n2 self.data = [e] * (n2 * 2) def build(self, a): for i, x in enumerate(a): self.data[i + self.n] = x for i in range(self.n - 1, 0, -1): self.data[i] = self.data[i * 2] + self.data[i * 2 + 1] def update(self, i, x): k = i + self.n self.data[k] = x while k > 1: k //= 2 self.data[k] = self.data[k * 2] + self.data[k * 2 + 1] def query(self, l, r, ls, rs): l += self.n r += self.n while l < r: if l & 1: ls += self.data[l] l += 1 if r & 1: r -= 1 rs = self.data[r] + rs l //= 2 r //= 2 return ls + rs MOD = 998244353 class Matrix: def __init__(self, a): self.a = a def __add__(self, other): return Matrix(self.a @ other.a % MOD) node = [ Matrix(np.array([ [1, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0], [1, 1, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0], [0, 0, 0, 1, 1, 0], [0, 0, 0, 1, 1, 1], ], dtype=np.int64)), Matrix(np.array([ [1, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0], [1, 1, 0, 1, 0, 0], [0, 0, 1, 0, 1, 0], [0, 0, 1, 0, 1, 1], ], dtype=np.int64)), ] identity = Matrix(np.array([ [1, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0], [0, 0, 0, 1, 0, 0], [0, 0, 0, 0, 1, 0], [0, 0, 0, 0, 0, 1], ], dtype=np.int64)) n, q = map(int, input().split()) s = input() s_seq = [int(x) for x in s] st = SegmentTree(n, identity) st.build([node[x] for x in s_seq]) for _ in range(q): t, *args = map(int, input().split()) if t == 1: i = args[0] - 1 s_seq[i] = 1 - s_seq[i] st.update(i, node[s_seq[i]]) else: l, r = args ans = st.query(l - 1, r, Matrix(np.array([0, 0, 0, 0, 0, 1], dtype=np.int64)), Matrix(np.array([1, 0, 0, 0, 0, 0], dtype=np.int64))) print(ans.a)