#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
class segtree{
public:
vi tree;
vi beg, end;
int n;
segtree(int size){
n = 1;
while(n < size) n*= 2;
beg.resize(2*n);
end.resize(2*n);
tree.resize(2*n, -INF);
REP(i, n) {
beg[i + n] = i;
end[i + n] = i+1;
}
FORD(i, n-1, 1, 1){
end[i] = end[2*i + 1];
beg[i] = beg[2*i];
}
}
int query(int l, int r, int v = 1){
if(beg[v] >= r || end[v] <= l) return -INF;
if(beg[v] >= l && end[v] <= r) return tree[v];
return max(query(l, r, 2*v), query(l, r, 2*v+1));
}
void update(int pos, int val){
pos+=n;
tree[pos] = val;
for(int i = pos/2; i > 0; i/=2) tree[i] = max(tree[2*i], tree[2*i+1]);
}
};
struct AcAutomaton{
vector<tuple<string, int, int>> queries;
int n, q;
string s;
void read_in(){
cin >> n >> q;
cin >> s;
REP(j, q){
string type; cin >> type;
if(type == "toggle"){
int a; cin >> a; --a;
queries.pb(make_tuple(type, a, 0));
}
else{
int a, b; cin >> a >> b; --a; --b;
queries.pb(make_tuple(type, a, b));
}
}
}
void solve_subtask1(){
vector<string> strings;
strings.pb(s);
REP(j, q){
tuple<string, int, int> query = queries[j];
if(get<0>(query) == "toggle"){
int id = get<1>(query);
if(s[id] == '1') s[id] = '0';
else s[id] = '1';
}
else{
int ans = 0;
int l = get<1>(query);
int r = get<2>(query);
REP(i, strings.size()){
string tmp = strings[i];
bool can = true;
FOR(j, l, r, 1){
if(tmp[j] == '0') can = false;
}
if(can) ans++;
}
cout << ans << endl;
}
strings.pb(s);
}
}
void solve_subtask2(){
vi prev(n, INF);
vi cnt(n, 0);
REP(i, s.length())
if(s[i] == '1') prev[i] = -1;
REP(j, q){
tuple<string, int, int> query = queries[j];
if(get<0>(query) == "toggle"){
int id = get<1>(query);
if(s[id] == '1'){
cnt[id] += (j - prev[id]);
prev[id] = INF;
s[id] = '0';
}
else{
prev[id] = j;
s[id] = '1';
}
}
else{
int id = get<1>(query);
int ans = 0;
if(s[id] == '1') {
ans += j - prev[id];
}
ans += cnt[id];
cout << ans << endl;
}
}
}
void solve_subtask3(){
segtree st(n);
REP(i, s.length()){
if(s[i] == '1') st.update(i, -1);
else st.update(i, INF);
}
REP(j, q){
tuple<string, int, int> query = queries[j];
if(get<0>(query) == "toggle"){
int id = get<1>(query);
if(s[id] == '1') {
st.update(id, INF);
}
else{
st.update(id, j);
}
}
else{
int l = get<1>(query);
int r = get<2>(query);
int maxi = st.query(l, r);
if(maxi == INF) cout << 0 << endl;
else cout << j - maxi << endl;
}
}
}
void solve(){
if(n <= 100 && q <= 100) solve_subtask1();
else{
bool sub2 = true;
REP(i, q) if(get<0>(queries[i]) == "query" && get<1>(queries[i]) + 1 != get<2>(queries[i])) sub2 = false;
if(sub2) solve_subtask2();
else solve_subtask3();
}
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int tcase = 1;
while(tcase--){
AcAutomaton solver;
solver.read_in();
solver.solve();
}
return 0;
}
