#include<bits/stdc++.h>
using namespace std;
const int MAX_N=1<<20|5,MOD=998244353;
char s[MAX_N];
int x[MAX_N];
int main(){
    int m,q;
    while(scanf("%d%d",&m,&q)!=EOF){
    scanf("%s",s+1);
    for(int i=1<<m-1;i<1<<m;++i) x[i]=i-(1<<m-1)+1;
    for(int i=(1<<m-1)-1;i>=1;--i){
        if(s[i]=='0') x[i]=(x[i+i]+x[i+i+1])%MOD;
        else x[i]=1ll*x[i+i]*x[i+i+1]%MOD;
    }
//    for(int i=1;i<1<<m;++i) printf("(%d)",x[i]);
    while(q--){
        int opt,i; scanf("%d%d",&opt,&i);
        i=i+(1<<m-1)-1;
        if(opt==1){
            int y; scanf("%d",&y);
            x[i]=y;
            for(i>>=1;i;i>>=1){
                if(s[i]=='0') x[i]=(x[i+i]+x[i+i+1])%MOD;
                else x[i]=1ll*x[i+i]*x[i+i+1]%MOD;
            }
        }else{
            int ret=1;
            for(;i!=1;i>>=1) 
                if(s[i>>1]=='1')
                    ret=1ll*ret*x[i^1]%MOD;
            printf("%d\n",ret);
        }
    }
    }
    return 0;
}