#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

gp_hash_table<long long, int> F;

void add(int x, int y, int val) {
    int st = y;
    while (x > 0) {
        y = st;
        while (y > 0) {
            F[(long long) x * (long long) 1e9 + y] += val;
            y -= (y & (-y));
        }
        x -= (x & (-x));
    }
}

void add(int l1, int r1, int l2, int r2, int val) {
    add(r1, r2, val);
    add(l1 - 1, r2, -val);
    add(r1, l2 - 1, -val);
    add(l1 - 1, l2 - 1, val);
}

const int N = (int) 1e5 * 3 + 10;

int get(int x, int y) {
    int res = 0, st = y;
    while (x < N) {
        y = st;
        while (y < N) {
            res += F[(long long) x * (long long) 1e9 + y];
            y += (y & (-y));
        }
        x += (x & (-x));
    }
    return res;
}

set<pair<int, int>> st;
int pr[N];

void insert(int val) {
    int L = val, R = val;
    if (pr[R + 1] != -1) {
        st.erase({R + 1, pr[R + 1]});
        R = pr[R + 1];
        pr[pr[R]] = -1;
    }
    if (L >= 1 && pr[L - 1] != -1) {
        st.erase({pr[L - 1], L - 1});
        L = pr[L - 1];
        pr[pr[L]] = -1;
    }
    st.insert({L, R});
    pr[L] = R, pr[R] = L;
}

void del(int val) {
    auto it = --st.lower_bound({val + 1, 0});
    int L = it->first, R = it->second;
    st.erase(it);
    pr[L] = pr[R] = -1;
    if (val - 1 >= L) {
        st.insert({L, val - 1});
        pr[L] = val - 1, pr[val - 1] = L;
    }
    if (val + 1 <= R) {
        st.insert({val + 1, R});
        pr[val + 1] = R, pr[R] = val + 1;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    for (int i = 0; i < N; i++) pr[i] = -1;
    int n, q, L = -1, R = -1;
    string t;
    cin >> n >> q >> t;
    string s = '#' + t;
    for (int i = 1; i <= n; i++) {
        if (s[i] == '0') {
            if (L != -1)
                st.insert({L, R});
            L = R = -1;
        } else {
            if (L == -1) L = R = i;
            else R++;
        }
    }
    if (L != -1) st.insert({L, R});
    for (auto [a, b]: st)
        pr[a] = b, pr[b] = a;
    for (int i = 1; i <= q; i++) {
        string type;
        cin >> type;
        if (type == "toggle") {
            int ind;
            cin >> ind;
            if (s[ind] == '0') {
                if (pr[ind - 1] != -1) L = pr[ind - 1];
                else L = ind;
                if (pr[ind + 1] != -1) R = pr[ind + 1];
                else R = ind;
                insert(ind);
                add(L, ind, ind + 1, R + 1, -i);
            } else {
                auto it = --st.lower_bound({ind + 1, 0});
                L = it->first, R = it->second;
                del(ind);
                add(L, ind, ind + 1, R + 1, i);
            }
            s[ind] = char(1 - (s[ind] - '0') + '0');
        } else {
            int a, b;
            cin >> a >> b;
            bool f = false;
            for (int j = a; j < b; j++) {
                if (s[j] == '0') f = true;
            }
            int res = get(a, b);
            if (!f) res += i;
            cout << res << "\n";
        }
    }
    return 0;
}