#include<bits/stdc++.h>
using namespace std;
namespace IO{
	template<typename T>inline bool read(T &x){
		x=0;
		char ch=getchar();
		bool flag=0,ret=0;
		while(ch<'0'||ch>'9') flag=flag||(ch=='-'),ch=getchar();
		while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar(),ret=1;
		x=flag?-x:x;
        return ret;
	}
	template<typename T,typename ...Args>inline bool read(T& a,Args& ...args){
	    return read(a)&&read(args...);
	}
	template<typename T>void prt(T x){
		if(x>9) prt(x/10);
		putchar(x%10+'0');
	}
	template<typename T>inline void put(T x){
		if(x<0) putchar('-'),x=-x;
		prt(x);
	}
	template<typename T>inline void put(char ch,T x){
		if(x<0) putchar('-'),x=-x;
		prt(x);
		putchar(ch);
	}
	template<typename T,typename ...Args>inline void put(T a,Args ...args){
	    put(a);
		put(args...);
	}
	template<typename T,typename ...Args>inline void put(const char ch,T a,Args ...args){
	    put(ch,a);
		put(ch,args...);
	}
	inline void put(string s){
		for(int i=0,sz=s.length();i<sz;i++) putchar(s[i]);
	}
	inline void put(const char* s){
		for(int i=0,sz=strlen(s);i<sz;i++) putchar(s[i]);
	}
	inline int getch(){
		char ch=getchar();
		while(ch!='0'&&ch!='1') ch=getchar();
		return ch-'0';
	}
	inline int getc(){
		char ch=getchar();
		while(ch!='q'&&ch!='t') ch=getchar();
		return ch=='q';
	}
}
using namespace IO;
#define N 300005
#define ll long long
int n,m,idx,w[N],rt[N],ls[N*60],rs[N*60];
ll t[N*60];
#define lc(x) ls[x]
#define rc(x) rs[x]
inline void Update(int &x,int l,int r,int ql,int qr,int val){
	if(!x) x=++idx;
	if(ql<=l&&qr>=r) return t[x]+=val,void();
	int mid=l+r>>1;
	if(ql<=mid) Update(lc(x),l,mid,ql,qr,val);
	if(qr>mid) Update(rc(x),mid+1,r,ql,qr,val);
}
inline ll Query(int x,int l,int r,int pos){
	if(!x) return 0;
	if(l==r) return t[x];
	int mid=l+r>>1;
	ll res=t[x];
	if(pos<=mid) res+=Query(lc(x),l,mid,pos);
	else res+=Query(rc(x),mid+1,r,pos);
	return res;
}
#undef lc
#undef rc
#define lowbit(x) (x&-x)
inline void update(int x,int l,int r,int v){
	if(l>r) return;
	for(;x<=n;x+=lowbit(x)) Update(rt[x],1,n,l,r,v);
}
inline int query(int x,int y){
	ll res=0;
	for(;x;x^=lowbit(x)) res+=Query(rt[x],1,n,y);
	return res;
}
#undef lowbit
set<pair<int,int> >s;
int main(){
	read(n,m);
	for(int i=1;i<=n;i++) w[i]=getch();
	for(int i=1;i<=n;i++){
		if(!w[i]) continue;
		int j=i;
		while(j<=n&&w[j]) j++;
		s.insert(make_pair(i,j-1));
		i=j-1;
	}
	for(int i=1,x,y;i<=m;i++){
		if(getc()){
			read(x,y);
			int ans=query(x,y-1);
			auto it=--s.lower_bound(make_pair(x+1,0));
			if(it->first<=x&&it->second>=y-1) ans+=i;
			put('\n',ans);
		}else{
			read(x);
			if(w[x]){
				auto it=--s.lower_bound(make_pair(x+1,0));
				int l=it->first,r=it->second;
				s.erase(it);
				if(l!=x) s.insert(make_pair(l,x-1));
				if(r!=x) s.insert(make_pair(x+1,r));
				update(l,x,r,i),update(x+1,x,r,-i);
			}else{
				int l=x,r=x;
				auto itl=s.lower_bound(make_pair(x+1,0)),itr=itl;
				if(itl!=s.begin()) itl--,l=itl->second==x-1?itl->first:l;
				if(itr!=s.end()) r=itr->first==x+1?itr->second:r;
				update(l,x,r,-i),update(r+1,x,r,i);
				if(l!=x) s.erase(itl);
				if(r!=x) s.erase(itr);
				s.insert(make_pair(l,r));		
			} 
		}
	}
	return 0;
}