#include <bits/stdc++.h>
using namespace std;
int n, m;
string s;
void sub1()
{
vector<string> vec;
while (m--) {
string q;
cin >> q;
vec.push_back(s);
//cout << s << '\n';
if (q == "query") {
int u, v;
cin >> u >> v;
u--, v--;
int ans = 0;
for (auto& p : vec) {
int ct = 0;
for (int i = u; i < v; i++) {
ct += p[i] - '0';
}
//cout << ct << ' ';
if (ct == v - u) ans++;
}
cout << ans << '\n';
} else {
int u;
cin >> u;
s[u - 1] = (s[u - 1] == '0' ? '1' : '0');
}
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
cin >> s;
if (n <= 100) sub1();
return 0;
}
/**
11011
11011
11111
qi = sum (min(up->vp) == 1)
p<=i
*/
