#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));
/* -------------------- Typedefs -------------------- */
typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;
/* -------------------- Usings -------------------- */
using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
/* -------------------- Defines -------------------- */
#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);
/* -------------------- Constants -------------------- */
const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(2e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);
/* -------------------- Functions -------------------- */
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void precision(int x) {
cout.setf(ios::fixed | ios::showpoint);
cout.precision(x);
}
ll gcd(ll a, ll b) {
if (a == 0 || b == 0) return 0;
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll range_sum(ll a, ll b) {
if (a > b) return 0ll;
ll dif = a - 1, cnt = b - a + 1;
ll ans = ((b - a + 1) * (b - a + 2)) / 2;
ans += ((b - a + 1) * dif);
return ans;
}
string dec_to_bin(ll a) {
string s = "";
for (ll i = a; i > 0; ) {
ll k = i % 2;
i /= 2;
char c = k + 48;
s += c;
}
if (a == 0) {
s = "0";
}
reverse(all(s));
return s;
}
ll bin_to_dec(string s) {
ll num = 0;
for (int i = 0; i < s.size(); i++) {
num *= 2ll;
num += (s[i] - '0');
}
return num;
}
ll factorial_by_mod(ll n, ll mod) {
ll ans = 1;
ll num;
for (ll i = 1; i <= n; ++i) {
num = i % mod;
ans *= num;
ans %= mod;
}
return ans;
}
bool isPrime(ll a) {
if (a == 1) return false;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) return false;
}
return true;
}
ll binpow(ll a, ll b) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
}
b >>= 1;
a *= a;
}
return ans;
}
ll binpow_by_mod(ll a, ll b, ll mod) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
ans %= mod;
}
b >>= 1;
a *= a;
a %= mod;
}
return ans;
}
/* -------------------- Solution -------------------- */
const int N = 300005, M = 30;
int a[N], sz[N], p[N], used[N], tin[N], tout[N];
pii up[N][M];
vector<pii> g[N];
int n, q, m, lg, cur, timer;
void make_set(int x) {
sz[x] = 1;
p[x] = x;
}
int find_set(int x) {
if (x == p[x]) return x;
return p[x] = find_set(p[x]);
}
void union_sets(int x, int y, int pah) {
int u = x, v = y;
x = find_set(x);
y = find_set(y);
if (x == y) return;
if (sz[x] > sz[y]) swap(x, y);
p[x] = y;
g[u].pub({ v,pah });
g[v].pub({ u,pah });
}
void dfs(int u, int par, int w) {
tin[u] = ++timer;
up[u][0] = { par,w };
used[u] = 1;
for (int lgx = 1; lgx <= lg; ++lgx) {
up[u][lgx] = up[up[u][lgx - 1].ff][lgx - 1];
up[u][lgx].ss = max(up[u][lgx].ss, w);
}
for (auto opt : g[u]) {
int to = opt.ff;
if (used[to]) continue;
dfs(to, u, opt.ss);
}
tout[u] = ++timer;
}
bool upper(int x, int y) {
return tin[x] <= tin[y] && tout[x] >= tout[y];
}
int find_max(int x, int y) {
int ret = 0;
for (int lgx = lg; lgx >= 0; --lgx) {
int node = up[x][lgx].ff;
if (upper(node, y)) continue;
ret = max(ret, up[x][lgx].ss);
x = node;
}
if (!upper(x, y)) {
ret = max(ret, up[x][0].ss);
x = up[x][0].ff;
}
swap(x, y);
for (int lgx = lg; lgx >= 0; --lgx) {
int node = up[x][lgx].ff;
if (upper(node, y)) continue;
ret = max(ret, up[x][lgx].ss);
x = node;
}
if (!upper(x, y)) {
ret = max(ret, up[x][0].ss);
x = up[x][0].ff;
}
return ret;
}
void slv() {
string s;
cin >> n >> q >> s;
m = n + 1;
lg = log2(m);
for (int i = 1; i <= m; ++i) {
make_set(i);
}
for (int i = 0; i < n; ++i) {
a[i + 1] = s[i] - '0';
}
for (int i = 1; i <= n; ++i) {
if (a[i]) {
union_sets(i, i + 1, 0);
}
}
vector<pair<int, pii>> harc(q + 1);
for (int i = 1; i <= q; ++i) {
cin >> s;
if (s[0] == 't') {
harc[i].ff = 0;
cin >> harc[i].ss.ff;
int ind = harc[i].ss.ff;
union_sets(ind, ind + 1, i);
continue;
}
harc[i].ff = 1;
cin >> harc[i].ss.ff >> harc[i].ss.ss;
}
for (int i = 1; i <= m; ++i) {
if (used[i]) continue;
dfs(i, i, 0);
}
for (int i = 1; i <= q; ++i) {
if (!harc[i].ff) {
int ind = harc[i].ss.ff;
continue;
}
int x = harc[i].ss.ff;
int y = harc[i].ss.ss;
if (find_set(x) != find_set(y)) {
cout << 0 << '\n';
continue;
}
cout << max(0, i - find_max(x, y)) << '\n';
}
}
void cs() {
int tstc = 1;
//cin >> tstc;
while (tstc--) {
slv();
}
}
void precalc() {
return;
}
int main() {
fastio();
precalc();
//precision(0);
cs();
return 0;
}
