#include <cstdio>
#include <cstring>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;

typedef long long ll;

const int N=(1<<20)+5,Mo=998244353;

int m,q,opt,x,y;
int val[N];
char s[N];

void upd(int x) {
    if (s[x]=='0') val[x]=(val[x<<1]+val[x<<1|1])%Mo;
    else val[x]=(ll)val[x<<1]*val[x<<1|1]%Mo;
}

int main() {
    scanf("%d%d",&m,&q);
    scanf("%s",s+1);
    fo(i,1<<m-1,(1<<m)-1) val[i]=i-(1<<m-1)+1;
    fd(i,(1<<m-1)-1,1) upd(i);
    for(;q;q--) {
        scanf("%d",&opt);
        if (opt==1) {
            scanf("%d%d",&x,&y);x+=(1<<m-1)-1;
            val[x]=y;
            for(x>>=1;x;x>>=1) upd(x);
        } else {
            scanf("%d",&x);x+=(1<<m-1)-1;
            int ans=1;
            for(;(x>>1);x>>=1) if (s[x>>1]=='1') ans=(ll)ans*val[x^1]%Mo;
            printf("%d\n",ans);
        }
    }
    return 0;
}