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

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

void solve(){
    int n,q; cin >> n >> q;
    vector<vector<int>> nums(n+1);
    vector<item> calced(n+1);
    vector<int> sizes(n+1,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;
            bool ok=calced[l].second;
            // if(calced[l].first==nums[l][calced[l].last]) calced[l].last++;
            for(int j=calced[l].last+1; j < sizes[l];j++){
                if(ok){
                    calced[l].val+=nums[l][j]-calced[l].first;
                    ok=false;
                    calced[l].first=nums[l][j];
                    calced[l].second=0;
                    calced[l].last=j;
                }
                else ok=true,calced[l].second=1,calced[l].first=nums[l][j],calced[l].last=j;
            }
            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);
            sizes[curr]++;
        }
    }
}

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