#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

template <typename T> class segTree
{
private:
  const T e;
  int num;
  std::vector<T> dat;
  T (*const eval)(T &, T &) {};
public:
  segTree(std::vector<T> &v, T E, T (*func)(T &, T &)) : e(E), eval(func)
  {
    int siz = static_cast<int>(v.size());
    for (num = 1; num < siz; num <<= 1);
    dat = std::vector<T> (2 * num - 1, e);
    for (int i = 0; i < siz; ++i) dat[i + num - 1] = v[i];
    for (int i = num - 2; i >= 0; --i) dat[i] = eval(dat[i * 2 + 1], dat[i * 2 + 2]);
  }
  segTree(int n, T E, T (*func)(T &, T &)) : e(E), eval(func)
  {
    for (num = 1; num < n; num <<= 1);
    dat = std::vector<T> (2 * num - 1, e);
  }
  void update_a(int i, T val)
  {
    for (i += num - 1, dat[i] = val; i != 0;)
    {
      i = (i - 1) / 2;
      dat[i] = eval(dat[i * 2 + 1], dat[i * 2 + 2]);
    }
  }
  void update_r(int i, T val)
  {
    for (i += num - 1, dat[i] = eval(dat[i], val); i != 0;)
    {
      i = (i - 1) / 2;
      dat[i] = eval(dat[i * 2 + 1], dat[i * 2 + 2]);
    }
  }
  T getval(int left, int right)
  {
    left = max(0, left), right = min(num, right);
    T ansl = e, ansr = e;
    for (left += num - 1, right += num - 1; left < right; left >>= 1, right >>= 1)
    {
      if (!(left & 1)) ansl = eval(ansl, dat[left]);
      if (--right & 1) ansr = eval(dat[right], ansr);
    }
    return eval(ansl, ansr);
  }
  T getval(int id) {return dat[num - 1 + id];}
};

int main()
{
  const int mod = 998244353;
  int n, q;
  cin >> n >> q;
  string s;
  cin >> s;
  auto eval = [](vector<vector<long long>> &b, vector<vector<long long>> &a) -> vector<vector<long long>>
  {
    int siz = a.size();
    vector<vector<long long>> ret(siz, vector<long long> (siz));
    for (int i = 0; i < siz; ++i) for (int j = 0; j < siz; ++j) for (int k = 0; k < siz; ++k) ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]) % mod;
    return ret;
  };
  vector<vector<vector<long long>>> v(n, vector<vector<long long>> (3, vector<long long> (3)));
  for (int i = 0; i < n; ++i)
  {
    for (int j = 0; j < 3; ++j) v[i][j][j] = 1;
    if (s[i] == '1') v[i][1][0] = v[i][1][2] = 1;
    if (s[i] == '0') v[i][0][1] = 1;
  }
  vector<vector<long long>> e(3, vector<long long> (3));
  for (int i = 0; i < 3; ++i) e[i][i] = 1;
  segTree<vector<vector<long long>>> sg(v, e, eval);
  set<int> st;
  for (int i = 0; i < n; ++i) st.insert(i);
  while (q--)
  {
    int t, l, r;
    cin >> t >> l >> r;
    --l;
    if (t == 1)
    {
      auto itr = st.lower_bound(l);
      vector<int> tmp;
      while (itr != st.end() && *itr < r)
      {
        tmp.push_back(*itr);
        ++itr;
      }
      while (!tmp.empty())
      {
        sg.update_a(tmp.back(), e);
        st.erase(tmp.back());
        tmp.pop_back();
      }
    }
    else
    {
      auto res = sg.getval(l, r);
      long long ans = 0;
      ans = (res[0][2] + res[1][2]) % mod;
      cout << ans << endl;
    }
  }
}