#include <bits/stdc++.h>
using namespace std;
#define int long long
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
void solve() {
int n, q;
string s;
cin >> n >> q >> s;
vector<int> go(n, -1);
go[n - 1] = (s[n - 1] == '1' ? n - 1 : -1);
for (int i = n - 2; i >= 0; i--) {
if (s[i] == '1') {
go[i] = (s[i + 1] == '1' ? go[i + 1] : i);
}
}
vector<array<int, 3>> queries;
vector<vector<pair<int, int>>> gos(n);
auto update = [&] (int i, int time, int nv) {
go[i] = nv;
gos[i].emplace_back(time, nv);
};
for (int i = 0; i < n; i++) {
update(i, 0, go[i]);
}
for (int i = 1; i <= q; i++) {
string t;
cin >> t;
if (t == "toggle") {
int id;
cin >> id;
--id;
if (s[id] == '1') {
update(id, i, -1);
for (int j = id - 1; j >= 0 && s[j] == '1'; j--) {
update(j, i, id - 1);
}
s[id] = '0';
} else {
update(id, i, (id + 1 < n && s[id + 1] == '1' ? go[id + 1] : id));
for (int j = id - 1; j >= 0 && s[j] == '1'; j--) {
update(j, i, go[id]);
}
s[id] = '1';
}
} else {
int l, r;
cin >> l >> r;
--l, --r;
queries.push_back({l, r - 1, i});
}
}
for (auto &[l, r, time] : queries) {
int res = 0;
for (int i = 0; i < (int) gos[l].size(); i++) {
if (gos[l][i].second < r) continue;
if (gos[l][i].first <= time) {
res += min(time, (i + 1 < (int) gos[l].size() ? gos[l][i + 1].first : time)) - gos[l][i].first;
}
}
cout << res << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
