#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,q;
cin>>n>>q;
string s;
cin>>s;
if (n<=100)
{
int pre[n+1],ans[n][n+1]={};
pre[0]=0;
for (int i=0;i<n;i++)
pre[i+1]=pre[i]+(s[i]-'0');
for (int i=0;i<n;i++)
for (int j=i+1;j<=n;j++)
ans[i][j]=(pre[j]-pre[i]==j-i);
while (q--)
{
string t;
cin>>t;
if (t=="query")
{
int a,b;
cin>>a>>b;
cout<<ans[a-1][b-1]<<endl;
}
else
{
int i;
cin>>i;
s[i-1]=char('0'+1-(s[i-1]-'0'));
}
pre[0]=0;
for (int i=0;i<n;i++)
pre[i+1]=pre[i]+(s[i]-'0');
for (int i=0;i<n;i++)
for (int j=i+1;j<=n;j++)
ans[i][j]+=(pre[j]-pre[i]==j-i);
}
}
else
{
int las[n],su[n]={};
for (int i=0;i<n;i++)
if (s[i]=='1')
las[i]=0;
for (int m=1;m<=q;m++)
{
string t;
cin>>t;
if (t=="toggle")
{
int i;
cin>>i;
i--;
if (s[i]=='0')
{
las[i]=m;
s[i]='1';
}
else
{
su[i]+=m-las[i];
s[i]='0';
}
}
else
{
int a,b;
cin>>a>>b;
a--;
int ans=su[a];
if (s[a]=='1')
ans+=m-las[a];
cout<<ans<<endl;
}
}
}
return 0;
}
