#include <cstdio>
#include <cstring>
#define MOD 998244353
#define MAXN 150010

int N, Q;
char S[MAXN];
int sum0[MAXN], sum1[MAXN], pow2[MAXN], inv2[MAXN], fac[MAXN], inv[MAXN];

int quick_pow(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = 1LL * res * a % MOD;
        a = 1LL * a * a % MOD;
        b >>= 1;
    }
    return res;
}

void init() {
    pow2[0] = inv2[0] = fac[0] = inv[0] = 1;
    for (int i = 1; i <= N; ++i) {
        pow2[i] = 2LL * pow2[i - 1] % MOD;
        inv2[i] = 1LL * inv2[i - 1] * (MOD + 1) / 2 % MOD;
        fac[i] = 1LL * fac[i - 1] * i % MOD;
        inv[i] = 1LL * (MOD - MOD / i) * inv[MOD % i] % MOD;
    }
    for (int i = 2; i <= N; ++i) inv[i] = 1LL * inv[i - 1] * inv[i] % MOD;
}

int C(int n, int m) {
    if (m > n || m < 0) return 0;
    return 1LL * fac[n] * inv[m] % MOD * inv[n - m] % MOD;
}

int main() {
    scanf("%d%d%s", &N, &Q, S + 1);
    init();
    for (int i = 1; i <= N; ++i) {
        sum0[i] = sum0[i - 1] + (S[i] == '0');
        sum1[i] = sum1[i - 1] + (S[i] == '1');
    }
    while (Q--) {
        int op, x, y;
        scanf("%d%d", &op, &x);
        if (op == 1) {
            if (S[x] == '0') --sum0[x], ++sum1[x], S[x] = '1';
            else --sum1[x], ++sum0[x], S[x] = '0';
            for (int i = x + 1; i <= N; ++i) sum0[i] = sum0[i - 1], sum1[i] = sum1[i - 1];
        } else {
            scanf("%d", &y);
            int ans = 0, len = y - x + 1, cnt0 = sum0[y] - sum0[x - 1], cnt1 = sum1[y] - sum1[x - 1];
            for (int i = 0; i <= cnt0; ++i) {
                int res = 1LL * C(cnt0, i) * C(len - i, cnt1) % MOD * pow2[i] % MOD;
                if (i & 1) ans = (ans - res + MOD) % MOD;
                else ans = (ans + res) % MOD;
            }
            printf("%d\n", ans);
        }
    }
    return 0;
}