/// Template path: /home/mohammed/.config/sublime-text-3/Packages/User
#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;
// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> vecint;
typedef vector<char> vecchar;
typedef vector<string> vecstr;
typedef vector<long long> vecll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
// Marcos
#define endl ("\n")
#define int long long
#define mod 1000000007
#define pi (3.141592653589)
#define REP(i,a,b) for (int i = a; i < b; i++)
#define RREP(i,a,b) for (int i = a; i > b; i--)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
// Functions
long long squared(long long x) {return (x * x) % mod;}
int factorial(int n) {long long res = 1; for (int i = 1; i <= n; i++) {res = ((res * i) % mod + mod) % mod ;} return res;}
long long power(long long x, long long p) {if (p == 0) {return 1;} if (p % 2 == 1) {return (power(x, p - 1) * x) % mod;} return squared(power(x, p / 2));}
// cout << fixed;
// cout << setprecision(4);
// ---------(^_^)--------- //
struct segtree {
int size = 1;
vector<int> mx;
void init(int n) {
while (size < n)size *= 2;
mx.assign(2 * size, -1);
}
void build(vector<int>&v, int x, int lx, int rx) {
if (rx - lx == 1) {
if (lx < v.size()) {
mx[x] = v[lx];
}
return;
}
int m = (lx + rx) / 2;
build(v, 2 * x + 1, lx, m);
build(v, 2 * x + 2, m, rx);
mx[x] = max(mx[2 * x + 1] , mx[2 * x + 2]);
}
void build(vector<int> &v) {
build(v, 0, 0, size);
}
void set(int i, int v, int x, int lx, int rx) {
if (rx - lx == 1) {
mx[x] = v;
return;
}
int m = (lx + rx) / 2;
if (i < m) {
set(i, v, x * 2 + 1, lx, m);
} else {
set(i, v, x * 2 + 2, m, rx);
}
mx[x] = max(mx[2 * x + 1] , mx[2 * x + 2]);
}
void set(int i, int v) {
set(i, v, 0, 0, size);
}
int maxel (int l, int r, int x, int lx, int rx) {
if (rx <= l || r <= lx )return -1;
if (l <= lx && rx <= r) return mx[x];
int m = (rx + lx) / 2;
int n1 = maxel(l, r, x * 2 + 1, lx, m );
int n2 = maxel(l, r, x * 2 + 2, m, rx );
return max(n1 , n2);
}
int maxel(int l, int r) {
return maxel(l, r, 0, 0, size);
}
};
void main_solve() {
int n, q; cin >> n >> q;
string s; cin >> s;
int we = q + 2;
vector<int> v(n, we);
for (int i = 0; i < n ; i ++) {
if (s[i] == '1') {
v[i] = 0;
}
}
segtree st;
st.init(n);
st.build(v);
int curr_time = 0;
while (q--) {
curr_time++;
string type; cin >> type;
if (type == "toggle") {
int x; cin >> x;
st.set(x - 1, curr_time);
} else {
int a, b; cin >> a >> b;
int e = st.maxel(a - 1, b - 1);
if (e > curr_time) {
cout << 0 << endl;
} else {
cout << curr_time - e << endl;
}
}
}
}
int32_t main() {
fast;
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// Just another problem (-_-)
int t;
t = 1;
// cin >> t;
while (t--) {
main_solve();
}
}
