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

struct item{
    int first=1,second=0,val=0;
};

void solve(){
    int n,q; cin >> n >> q;
    if(n<=100 && q<=100){
        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';
        }
        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=0; j <=i-1;j++){
                    for(int k=l; k <=r-1;k++){
                        if(arr[j][k]==0) break;
                        if(k==r-1) ans++;
                    }
                }
                cout << ans << endl;
            } else{
                int curr; cin >> curr;
                arr[i][curr]=!arr[i][curr];
            }
        }
    } else{
        vector<vector<int>> nums(n+1);
        vector<item> calced(n+1);
        for(int i=1; i <= n;i++){
            char c; cin >> c;
            nums[i].push_back(0);
            calced[i].second=c-'0';
        }
        for(int i=1; i <= q;i++){
            string s; cin >> s;
            if(s=="query"){
                int l,r; cin >> l >> r;
                int it=lower_bound(nums[l].begin(),nums[l].end(),calced[l].first)-nums[l].begin();
                bool ok=calced[l].second;
                for(int j=it ; j < nums[l].size();j++){
                    if(ok){
                        calced[l].val+=nums[l][j]-calced[l].first;
                        ok=false;
                        calced[l].first=nums[l][j];
                        calced[l].second=0;
                    }
                    else ok=true,calced[l].second=1,calced[l].first=nums[l][j]+1;
                }
                if(calced[l].second){
                    calced[l].val+=i-calced[l].first;
                }
                calced[l].first=i;
                cout << calced[l].val << endl;
            } else{
                int curr; cin >> curr;
                nums[curr].push_back(i);
            }
        }

        
        
    }
    
}

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