//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 3e5 + 10, M = 1e7 + 10;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % mod;
}
b >>= 1;
a = (a * a) % mod;
}
return res;
}
ll n, q, a[N], fr[N];
struct segtree {
int size = 1;
vector<ll> stree;
void init() {
while (size <= n + 1) size <<= 1;
stree.assign(4 * size, -inf);
}
void upd(int i, ll v, int x, int lx, int rx) {
if (rx - lx == 1) {
stree[x] = v;
return;
}
int m = (lx + rx) / 2;
if (i < m) upd(i, v, 2 * x + 1, lx, m);
else upd(i, v, 2 * x + 2, m, rx);
stree[x] = max(stree[2 * x + 1], stree[2 * x + 2]);
}
ll qry(int l, int r, int x, int lx, int rx) {
if (lx >= r || rx <= l) return -inf;
if (lx >= l && rx <= r) return stree[x];
int m = (lx + rx) / 2;
return max(qry(l, r, 2 * x + 1, lx, m), qry(l, r, 2 * x + 2, m, rx));
}
void upd(int i, ll v) {
upd(i, v, 0, 0, size);
}
ll qry(int l, int r) {
return qry(l, r, 0, 0, size);
}
} st;
struct DSU {
int sz[N], par[N];
void init() {
for (int i = 1; i <= n + 1; i++) {
sz[i] = 1;
par[i] = i;
}
}
int find(int a) {
if (a == par[a]) return par[a];
return par[a] = find(par[a]);
}
bool merge(int a, int b) {
a = find(a), b = find(b);
if (a == b) return 0;
if (sz[a] > sz[b]) swap(a, b);
sz[b] += sz[a];
par[a] = b;
return 1;
}
}dsu;
void solve(int tc) {
cin >> n >> q;
st.init();
dsu.init();
string s;
cin >> s;
s = "$" + s;
for (int i = 1; i <= n; i++) {
a[i] = (s[i] - '0');
if (a[i]) st.upd(i, 0), dsu.merge(i, i + 1);
}
for (int i = 1; i <= q; i++) {
string type;
cin >> type;
if (type[0] == 't') {
int j;
cin >> j;
assert(a[j] == 0);
dsu.merge(j, j + 1);
st.upd(j, i);
a[i] ^= 1;
}
else {
int u, v;
cin >> u >> v;
ll d = st.qry(u, v);
cout << (dsu.find(u) != dsu.find(v) ? 0 : i - d) << endl;
}
}
}
void precalc() {
}
int main() {
// SetIO("teamwork");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
return 0;
}
