#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define all(x) x.begin(),x.end()
#define N 300010
ll n,q;
ll tim[N],pnt[N],flag[N];
int main(){
cin>>n>>q;
string s;
cin>>s;
rep(i,n){
tim[i]=0,pnt[i]=0,flag[i]=(s[i]=='1');
}
for(int i=1;i<=q;i++){
string typ;
cin>>typ;
if(typ=="toggle"){
ll x; cin>>x;
x--;
pnt[x]+=flag[i]*(i-tim[x]);
tim[x]=i;
flag[i]^=1;
}
else{
ll x,b; cin>>x>>b;
x--;
pnt[x]+=flag[i]*(i-tim[x]);
tim[x]=i;
cout<<pnt[x]<<endl;
}
}
}
