#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin() , x.end()
#define sze(x) (ll)(x.size())
typedef long long ll;
typedef pair<ll , ll> pll;
typedef pair<bool , pll> plll;
const ll maxn = 3e5 + 16 , inf = 2e18;
ll n , q;
string s;
vector<plll> qu;
bitset<102> a[102];
ll ans[maxn] , lst[maxn];
void sub1(){
for(ll i = 0 ; i < n ; i++){
a[0][i] = (s[i] == '1');
}
for(ll i = 1 ; i <= q ; i++){
string t;
cin>>t;
if(t[0] == 'q'){
a[i] = a[i - 1];
ll l , r;
cin>>l>>r; l--; r--;
ll ans = 0;
for(ll j = 0 ; j < i ; j++){
bool ch = true;
for(ll k = l ; k < r ; k++){
ch &= a[j][k];
}
ans += ch;
}
cout<<ans<<'\n';
} else {
ll j;
cin>>j; j--;
a[i] = a[i - 1];
a[i][j] = a[i][j] ^ 1;
}
}
return;
}
void sub2(){
memset(ans , 0 , sizeof(ans));
memset(lst , -1 , sizeof(lst));
for(ll i = 0 ; i < n ; i++){
if(s[i] == '1') lst[i] = 0;
}
for(ll i = 1 ; i <= q ; i++){
bool t = qu[i - 1].first;
ll j = qu[i - 1].second.first;
if(t){
ll res = ans[j];
if(lst[j] != -1){
res += i - lst[j];
}
cout<<res<<'\n';
} else {
if(lst[j] != -1){
ans[j] += i - lst[j];
lst[j] = -1;
} else {
lst[j] = i;
}
}
}
return;
}
int main(){
ios_base::sync_with_stdio(false); cout.tie(0); cin.tie(0);
cin>>n>>q>>s;
if(n <= 1e2 && q <= 1e2){
sub1();
return 0;
}
bool s2 = true;
for(ll i = 0 ; i < q ; i++){
string t;
cin>>t;
plll p;
p.first = (t[0] == 'q');
if(p.first){
ll l , r;
cin>>l>>r; l--; r--;
s2 &= (r - l == 1);
p.second = {l , r};
} else {
ll j;
cin>>j; j--;
p.second = {j , -1};
}
qu.push_back(p);
}
if(s2){
sub2();
}
return 0;
}
