#include <bits/stdc++.h>
#define MOD 998244353

using namespace std;

typedef long long ll;

char str[1100005];

int f[1100005];

void build(int m) {
  for(int i=0;i<(1<<(m-1));i++) f[i+(1<<(m-1))]=i+1;
  for(int i=(1<<(m-1))-1;i>0;i--) 
    f[i]=((str[i]=='0')?f[i<<1]+f[(i<<1)+1]:(ll)f[i<<1]*f[(i<<1)+1])%MOD;
}

void update(int x,int y,int m) {
  int u=(1<<(m-1))+x-1;
  f[u]=y;
  for(u>>=1;u;u>>=1)
    f[u]=((str[u]=='0')?f[u<<1]+f[(u<<1)+1]:(ll)f[u<<1]*f[(u<<1)+1])%MOD;
}

int query(int x,int m) {
  int u=(1<<(m-1))+x-1,s=1;
  for(;u>1;u>>=1)
    if (str[u>>1]=='1') s=(ll)s*(((u>>1<<1)!=u)?f[u-1]:f[u+1])%MOD;
  return s;
}

int main() {
  int n,m;
  scanf("%d%d%s",&m,&n,str+1);
  build(m);
  for(int i=1;i<=n;i++) {
      int kind;
      scanf("%d",&kind);
      if (kind==1) {
          int x,y;
          scanf("%d%d",&x,&y);
          update(x,y,m);
      }
    else {
        int x;
        scanf("%d",&x);
        printf("%d\n",query(x,m));
    }
  }
  return 0;
}