#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned ll
#define i128 __int128
#define db double
#define ld long db

#define M 5700005
#define N 300005
#define mod 1000000009
#define mod2 1222827239
#define base 51787
#define base2 38833
#define inf 1e9+7
#define dinf 1e15
#define linf 7e18

int n,m;
char c[N];
bool s[N],d[N];

struct Query{
	char op[7];
	int i,j;
}q[N];

vector<pair<int,int> > g[N];

int ans[N];

int main(){
	scanf("%d %d %s",&n,&m,c+1);
	for(int i=1;i<=n;++i) s[i]=(c[i]=='1');
	for(int i=1;i<=n;++i) if(s[i]) g[i].push_back(make_pair(0,0));
	for(int i=1;i<=m;++i){
		q[i].j=0;
		scanf("%s %d",q[i].op,&q[i].i);
		if(q[i].op[0]=='q') scanf("%d",&q[i].j);
		g[q[i].i].push_back(make_pair(q[i].op[0]=='q',i));
	}
	for(int i=1;i<=n;++i){
		int lst=-1;
		int sum=0;
		for(auto v:g[i]){
			int op=v.first,t=v.second;
			if(!op){
				d[i]^=1;
				if(d[i]) lst=t;
				else sum+=t-lst,lst=-1;
			} else {
				if(~lst) ans[t]=sum+t-lst;
				else ans[t]=sum;
			}
		}
	}
	for(int i=1;i<=m;++i) if(q[i].op[0]=='q') printf("%d\n",ans[i]);
	return 0;
}