#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=3e5;
int n, q, ans[mxN], st[mxN];
string s;
vector<int> changes[mxN];
vector<ar<int, 2>> ls[mxN];
vector<ar<int, 4>> queries;
struct ft {
ll ft[mxN+1];
void upd(int i, ll x) {
for (++i; i<=mxN; i+=i&-i)
ft[i]+=x;
}
ll qry(int i) {
ll r=0;
for (++i; i; i-=i&-i)
r+=ft[i];
return r;
}
} ft1, ft2;
void upd(int l, int r, int x) {
ft1.upd(l, -(ll)(l-1)*x);
ft2.upd(l, x);
ft1.upd(r+1, (ll)r*x);
ft2.upd(r+1, -x);
}
ll qry(int i) {
return i*ft2.qry(i)+ft1.qry(i);
}
void solve(int l, int r) {
if (l==r)
return;
int mid=(l+r)/2;
solve(l, mid);
solve(mid+1, r);
vector<ar<int, 4>> tmp;
vector<ar<int, 3>> rb;
tmp.reserve(r-l+1);
for (int i=l, j=mid+1; tmp.size()<r-l+1;) {
if (j>r||i<=mid&&queries[i][0]<=queries[j][0]) {
if (queries[i][2]!=-1) { // update
upd(queries[i][1], queries[i][2], queries[i][3]);
rb.push_back({queries[i][1], queries[i][2], -queries[i][3]});
}
tmp.push_back(queries[i++]);
} else {
if (queries[j][2]==-1) // query
ans[queries[j][1]]+=qry(queries[j][1]);
tmp.push_back(queries[j++]);
}
}
for (int i=l; i<=r; ++i)
queries[i]=tmp[i-l];
for (auto [l, r, x] : rb)
upd(l, r, x);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q >> s;
for (int i=0; i<n; ++i)
if (s[i]=='0')
changes[i].push_back(-1);
for (int i=0; i<q; ++i) {
string type;
cin >> type;
if (type=="toggle") {
int x;
cin >> x, --x;
changes[x].push_back(i);
ans[i]=-1;
} else {
int l, r;
cin >> l >> r, --l, r-=2;
ls[r].push_back({l, i});
}
}
set<ar<int, 3>> s;
s.insert({0, q-1, 0});
queries.push_back({0, 0, q-1, 1});
for (int i=0; i<n; ++i) {
for (int j=0; j<changes[i].size(); j+=2) {
int b=j+1<changes[i].size()?changes[i][j+1]:q-1;
ar<int, 3> seg={changes[i][j]+1, b, i+1};
auto it=s.lower_bound({seg[0]});
while(it!=s.end()&&(*it)[0]<=seg[1]) {
if ((*it)[1]<=seg[1]) { // erase entire segment
queries.push_back({(*it)[2], (*it)[0], (*it)[1], -1});
it=s.erase(it);
} else { // erase part of this segment
int rb=(*it)[1], val=(*it)[2];
queries.push_back({val, (*it)[0], seg[1], -1});
s.erase(it);
it=s.insert({seg[1]+1, rb, val}).first;
}
}
if (it!=s.begin()) {
--it;
if ((*it)[1]>=seg[0]) {
int l=(*it)[0], r=(*it)[1], val=(*it)[2];
s.erase(it);
if (r<=seg[1]) {
queries.push_back({val, seg[0], r, -1});
s.insert({l, seg[0]-1, val});
} else {
assert(l<seg[0]&&seg[1]<r);
queries.push_back({val, seg[0], seg[1], -1});
s.insert({l, seg[0]-1, val});
s.insert({seg[1]+1, r, val});
}
}
}
/*while(s.size()) {
auto it=s.lower_bound({seg[0], -1});
if (it!=s.end()&&(*it)[0]<=seg[1]) {
int l=(*it)[0], r=(*it)[1], val=(*it)[2];
queries.push_back({val, l, min(r, seg[1]), -1});
s.erase(it);
if (r>seg[1])
s.insert({seg[1]+1, r, val});
} else if (it!=s.begin()) {
--it;
int l=(*it)[0], r=(*it)[1], val=(*it)[2];
if (r>=seg[0]) {
assert(l<seg[0]);
queries.push_back({val, seg[0], r, -1});
s.erase(it);
s.insert({l, seg[0]-1, val});
} else
break;
} else
break;
}*/
queries.push_back({seg[2], seg[0], seg[1], 1});
s.insert(seg);
}
for (auto [l, t] : ls[i])
queries.push_back({l, t, -1});
}
//for (auto x : queries)
// cout << x[0] << " " << x[1] << " " << x[2] << " " << x[3] << endl;
solve(0, queries.size()-1);
for (int i=0; i<q; ++i)
if (~ans[i])
cout << ans[i] << "\n";
return 0;
}
