#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

#include "atcoder/modint.hpp"
#include "atcoder/segtree.hpp"
using mint = atcoder::modint998244353;

struct st{
    mint fl,fr,gl,gr,hl,hr,q,c,d;
};

st op(const st &a, const st &b) {
    mint nfl = a.fl + b.fl + a.c * (b.c+b.d);
    mint ngl = a.gl + b.gl + a.d * (b.c+b.d);

    mint nfr = b.fr + a.fr + b.c * (a.c+a.d);
    mint ngr = b.gr + a.gr + b.d * (a.c+a.d);

    mint nhl = a.hl + b.hl + a.c * b.gl + a.d * b.fl + a.c*a.d*(b.c+b.d);
    mint nhr = b.hr + a.hr + b.c * a.gr + b.d * a.fr + b.c*b.d*(a.c+a.d);

    mint nq = a.q + b.q + (a.c+a.d)*b.hl + (b.c+b.d)*a.hr + a.fr * b.gl  + b.fl * a.gr;

    mint nc = a.c+b.c;
    mint nd = a.d+b.d;

    return {nfl, nfr, ngl, ngr, nhl, nhr, nq, nc, nd};
}

st e(){
    return {0,0, 0,0, 0,0, 0, 0,0};
}

const st st0 = {1,1, 0,0, 0,0, 0, 1,0};
const st st1 = {0,0, 1,1, 0,0, 0, 0,1};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,q; string s; in(n,q,s);
    atcoder::segtree<st,op,e> seg(n);
    rep(i,n){
        if(s[i] == '0') seg.set(i, st0);
        if(s[i] == '1') seg.set(i, st1);
    }

    while(q--){
        int type; in(type);
        if(type == 1){
            int i; in(i); i--;
            if(s[i] == '0'){
                seg.set(i, st1);
                s[i] = '1';
            }
            else{
                seg.set(i, st0);
                s[i] = '0';
            }
        }
        else{
            int l,r; in(l,r); l--;
            out(seg.prod(l,r).q.val());
        }
    }
}