#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve(){
    int n,q; cin >> n >> q;
    vector<vector<int>> arr(q+1,vector<int>(n+1));
    for(int i=1; i <= n;i++){
        char c; cin >> c;
        arr[0][i]=c-'0';
        // cout << arr[0][i] << ' ';
    }
    vector<bool> changes(q+1);
    for(int i=1; i <=q;i++){
        string s; cin >> s;
        arr[i]=arr[i-1];
        if(s=="query"){
            int ans=0;
            int l,r; cin >> l >> r;
            for(int j=1; j <=i;j++){
                if(changes[j]) continue;
                for(int k=l; k <=r;k++){
                    if(arr[j][k]==0) break;
                    if(k==r) ans++;
                }
            }
            cout << ans << endl;
        } else{
            int curr; cin >> curr;
            arr[i][curr]=!arr[i][curr];
            changes[i]=true;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t=1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}