#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 3e5 + 5, maxk = 3e5 + 5;
struct Node{
    int a, b, c;
    int id;
    int val;
    bool operator < (const Node T) const{
        if (a == T.a)
            if (b == T.b)
                return c < T.c;
            else
                return b < T.b;
        else
            return a < T.a;
    }
}t[8 * maxn], tmp[8 * maxn];
int pos = 0;
int k;
struct Tree_Array{
private:
    int tree[maxk];
    int lowbit(int x){return x & (-x);}
public:
    void add(int id, int val){
        while (id <= k){
            tree[id] += val;
            id += lowbit(id);
        }
    }
    int sum(int id){
        int res = 0;
        while (id > 0){
            res += tree[id];
            id -= lowbit(id);
        }
        return res;
    }
}Tree;
int ans[maxn];
void cdq(int L, int R){
    if (L == R)
        return;
    int mid = (L + R) >> 1;
    cdq(L, mid);
    cdq(mid + 1, R);
    int i = L, j = mid + 1, k = L;
    while (i <= mid && j <= R){
        if (t[i].b <= t[j].b){
            Tree.add(t[i].c, t[i].val);
            tmp[k++] = t[i++];
        }else{
            ans[t[j].id] += Tree.sum(t[j].c);
            tmp[k++] = t[j++];
        }
    }
    int ii = i - 1;
    while (i <= mid)
        tmp[k++] = t[i++];
    while (j <= R){
        ans[t[j].id] += Tree.sum(t[j].c);
        tmp[k++] = t[j++];
    }
    for (int i = L; i <= ii; i++)
        Tree.add(t[i].c, -t[i].val);
    for (int i = L; i <= R; i++)
        t[i] = tmp[i];
}
int n, q;
set <int> S; //存不连通的路
set <int>::iterator it;
int less_num(int x){
    if (S.empty())
        return 0;
    it = S.lower_bound(x);
    if (it == S.begin())
        return 0;
    return *(--it);
}
int greater_num(int x){
    if (S.empty())
        return n + 1;
    it = S.lower_bound(x);
    if (it == S.end())
        return n + 1;
    return *(it);
}
void add_rectangle(int T, int x1, int y1, int x2, int y2, int val){
    t[++pos] = {T, x1, y1, 0, val};
    t[++pos] = {T, x2 + 1, y2 + 1, 0, val};
    t[++pos] = {T, x1, y2 + 1, 0, -val};
    t[++pos] = {T, x2 + 1, y1, 0, -val};
}
void add(int T, int x){
    S.erase(x);
    int l = less_num(x) + 1;
    int r = greater_num(x + 1);
    add_rectangle(T, l, x + 1, x, r, q - T);
}
void del(int T, int x){
    S.insert(x);
    int l = less_num(x) + 1;
    int r = greater_num(x + 1);
    add_rectangle(T, l, x + 1, x, r, -(q - T));
}
char s[maxn];
int a[maxn];
bool is_query[maxn];
signed main(){
    cin >> n >> q;
    k = n + 1;
    cin >> s + 1;
    for (int i = 1; i <= n; i++)
        a[i] = s[i] - '0';
    for (int i = 1; i <= n; i++)
         S.insert(i);
    for (int i = 1; i <= n; i++){
        if (a[i]){
            add(0, i);
        }
    }
    string opt;
    int x, y;
    for (int T = 1; T <= q; T++){
        cin >> opt;
        if (opt == "query"){
            is_query[T] = true;
            cin >> x >> y;
            t[++pos] = {T, x, y, T, 0};
        }else{
            cin >> x;
            if (a[x] == 0){
                a[x] = 1;
                add(T, x);
            }else{
                a[x] = 0;
                del(T, x);
            }
        }
    }
    sort(t + 1, t + pos + 1);
    cdq(1, pos);
    for (int T = 1; T <= q; T++)
        if (is_query[T])
            cout << (ans[T] ? ans[T] - (q - T): 0) << endl;
}