#include<bits/stdc++.h>
#define N 300005
#define inf 0x3f3f3f3f3f3f3f3f
#define db double
#define LL long long
//#define int long long
#define veci vector<int>
#define pb push_back 
#define ins insert
#define era erase
#define II inline int 
#define IV inline void
#define lb lower_bound
#define ub upper_bound

#define re read() 
#define pf printf
#define gc getchar()
#define pfi(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)

#define ad(x,y) (x=(x+y>=mo) ? x+y-mo : x+y)
#define adn(x,y) ((x+y>=mo) ? x+y-mo : x+y)
#define de(x,y) (x=(x-y<0) ? x-y+mo : x-y)
#define den(x,y) ((x-y<0) ? x-y+mo : x-y)
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define mt(a,b) memset(a,b,sizeof(a)) 
#define clr(a,n) memset(a,0,sizeof(int)*(n)) 
#define cpy(f,g,n) memcpy(f,g,sizeof(int)*(n))
#define f(i,x,y) for(int i=(x); i<=(y); i++)
#define fl(i,x,y) for(int i=(x); i<(y); i++)
#define fb(i,x,y) for(int i=(y); i>=(x); i--)
using namespace std;
II read(){
	int res=0; char c=gc;
	while(c<48 || 57<c) c=gc;
	while(47<c && c<58) res=(res<<1)+(res<<3)+(c^48),c=gc;
	return res;
}
int n,q;
int a[N];
struct poi{
	int l,r,t,w,id;
	bool operator < (const poi &a)const{
		return l<a.l;
	} 
}p[N<<2];
int ans[N];
#define lowb(x) (x&-x)
int v1[N],v2[N];//1: cnt , 2: sum
IV add(auto v,int x,int k){
	while(x<=n) v[x]+=k,x+=lowb(x);
}
II gets(auto v,int x){
	int res=0;
	while(x) res+=v[x],x-=lowb(x);
	return res;
}
II que(auto v,int l,int r){
	return gets(v,r)-gets(v,l-1);
}
int cnt;
IV cdq(int l,int r){
	if(l>=r) return ;
	int mid=l+r>>1;
	cdq(l,mid); cdq(mid+1,r);
	int nr=mid+1;
	f(i,l,mid){
		for(;nr<=r && p[nr].l<=p[i].l; nr++) if(p[nr].id)ans[p[nr].id]+=que(v1,p[nr].r,n)*p[nr].t+que(v2,p[nr].r,n);
		if(p[i].w) add(v1,p[i].r,p[i].w),add(v2,p[i].r,-p[i].w*p[i].t);
	}
	for(;nr<=r;nr++) if(p[nr].id) ans[p[nr].id]+=que(v1,p[nr].r,n)*p[nr].t-que(v2,p[nr].r,n);
	f(i,l,mid) if(p[i].w) add(v1,p[i].r,-p[i].w),add(v2,p[i].r,p[i].w*p[i].t);
	sort(p+l,p+r+1);
}
set<int> s;
bool cmp(poi a,poi b){
	return a.t<b.t;
}
IV sol(){
	int l=0; 
	f(i,0,n)if(!a[i]){
		if(s.size()) p[++cnt]={*s.rbegin(),i,0,1,0};
		s.ins(i);
	}
	int x;
	char c;
	f(i,1,q){
		c=gc; x=re;
		if(c=='q') p[++cnt]={x,re,i,0,i};
		else
			if(a[x]^=1){
				auto o=s.find(x);
				p[++cnt]={*prev(o),x,i,-1,0}; 
				p[++cnt]={x,*next(o),i,-1,0};
				p[++cnt]={*prev(o),*next(o),i,1,0};
				s.era(o);
			}
			else{
				auto o=s.ins(x).first;
				p[++cnt]={*prev(o),x,i,1,0}; 
				p[++cnt]={x,*next(o),i,1,0};
				p[++cnt]={*prev(o),*next(o),i,-1,0};
			}
	}
	cdq(1,cnt);
	sort(p+1,p+1+cnt,cmp);
	f(i,1,cnt) if(p[i].id)pfi(ans[p[i].id]);
}
signed main(){
	n=re; q=re;
	f(i,1,n) a[i]=gc^48; gc;
	n++;
	sol();
	return 0;
}