//from duckindog wth depression
#include<bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int n, q;
bool a[N];
struct Query {
int ty, x, y;
Query() : ty(0), x(0), y(0) {}
Query(int ty, int x, int y) : ty(ty), x(x), y(y) {}
} Q[N];
int f[4 * N];
void build(int s, int l, int r) {
if (l == r) {
f[s] = (a[l] == 1 ? 0 : 1e8);
return;
}
int mid = l + r >> 1;
build(s * 2, l, mid); build(s * 2 + 1, mid + 1, r);
f[s] = max(f[s * 2], f[s * 2 + 1]);
}
void update(int s, int l, int r, int x, int y) {
if (y < l || y > r) return;
if (l == r) {
f[s] = x;
return;
}
int mid = l + r >> 1;
update(s * 2, l, mid, x, y); update(s * 2 + 1, mid + 1, r, x, y);
f[s] = max(f[s * 2], f[s * 2 + 1]);
}
int query(int s, int l, int r, int u, int v) {
if (v < l || u > r) return 0;
if (u <= l && r <= v) return f[s];
int mid = l + r >> 1;
return max(query(s * 2, l, mid, u, v), query(s * 2 + 1, mid + 1, r, u, v));
}
vector<int> bit[N], vt[N];
void upd(int i, int j, int time) {
for (; i; i -= i & -i) {
if (!vt[i].size() || vt[i].back() < j) continue;
auto p = lower_bound(vt[i].begin(), vt[i].end(), j) - vt[i].begin() + 1;
for (int t = p; t <= vt[i].size(); t += t & -t) {
bit[i][t] += max(0, time - query(1, 1, n, i, vt[i][t - 1]));
}
}
}
int que(int i, int j) {
int ret = 0;
for (; i <= n; i += i & -i) {
if (!vt[i].size() || vt[i].back() < j) continue;
auto p = lower_bound(vt[i].begin(), vt[i].end(), j) - vt[i].begin() + 1;
for (int t = p; t <= vt[i].size(); t += t & -t) ret += bit[i][t];
}
return ret;
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("duck.inp", "r")) {
freopen("duck.inp", "r", stdin);
freopen("duck.out", "w", stdout);
}
cin >> n >> q;
for (int i = 1; i <= n; ++i) {
char x; cin >> x;
a[i] = (x == '1');
}
vector<pair<int, int>> querylist;
for (int i = 1; i <= q; ++i) {
string ty; cin >> ty;
if (ty == "toggle") {
int x; cin >> x;
Q[i] = {0, x, 0};
} else {
int x, y; cin >> x >> y;
querylist.push_back({x, y - 1});
Q[i] = {1, x, y - 1};
}
}
sort(querylist.begin(), querylist.end());
querylist.resize(unique(querylist.begin(), querylist.end()) - querylist.begin());
for (auto duck : querylist) {
int x, y; tie (x, y) = duck;
for (int i = x; i <= n; i += i & -i) vt[i].push_back(y);
}
for (int i = 1; i <= n; ++i) {
sort(vt[i].begin(), vt[i].end());
bit[i].resize(vt[i].size() + 1);
}
build(1, 1, n);
for (int i = 1; i <= q; ++i) {
int ty = Q[i].ty, x = Q[i].x, y = Q[i].y;
if (!ty) {
a[x] = 1 - a[x];
if (a[x]) {
update(1, 1, n, i, x);
} else {
upd(x, x, i);
update(1, 1, n, 1e8, x);
}
} else {
cout << max(0, i - query(1, 1, n, x, y)) + que(x, y) << '\n';
}
}
}
