// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 1000006
#define inf 0x3f3f3f3f

int n,m,a[maxn];
char s[maxn];
int ql[maxn],qr[maxn],qk[maxn],res[maxn];
vi qs[maxn];

//int fa[maxn];
//int gf(int x){
//	while(x!=fa[x])x=fa[x]=fa[fa[x]];
//	return x;
//}
int tim[maxn];

int L[maxn],R[maxn];
void del(int u){
	R[L[u]]=R[u],L[R[u]]=L[u];
}
vi de[maxn];
void get_tim(){
	For(i,0,n+1) L[i]=max(0,i-1),R[i]=min(n+1,i+1);
	vi o;
	For(i,1,n) tim[i]=0;
	For(i,1,n) if(i==1 || a[i]!=a[i-1]) o.pb(i);
	int nowt=0;
	while(o.size()){
		++nowt;
		vi o2;
		for(int u:o){
			del(u),tim[u]=nowt;
			o2.pb(R[u]);
		}
		o.clear();
		for(int x:o2){
			if(!tim[x] && (L[x]==0 || a[x]!=a[L[x]])) o.pb(x);
		}
	}
}

struct bit{
	vector<int>tr;
	int n;
	void init(int N){n=N,tr=vector<int>(N+1,0);}
	void add(int x,int y){for(;x<=n;x+=x&-x)tr[x]+=y;}
	int ask(int x){
		int s=0;
		for(;x;x^=x&-x)s+=tr[x];
		return s;
	}
	void down(){For(i,1,n)tr[i]+=tr[i^(i&-i)];}
}tr;

void solve(int op){
	tr.init(n);
	For(i,1,n) tr.add(i,1);
	For(i,1,n){
		for(int x:de[i]) tr.add(x,-1);
		for(int id:qs[i]){
			if(op==1) res[id]+=tr.ask(qr[id]);
			else res[id]-=tr.ask(ql[id]-1);
		}
	}
}

signed main()
{
	n=read(),m=read();
	scanf("%s",s+1);
	For(i,1,n) a[i]=(s[i]&1);
	For(i,1,m) {
		ql[i]=read(),qr[i]=read(),qk[i]=read();
		if(!qk[i]) res[i]=qr[i]-ql[i]+1;
	}
	
	// del left
	get_tim();
	For(i,1,n) de[tim[i]].pb(i);
	For(i,1,m) qs[qk[i]].pb(i);
	solve(1);
	
	reverse(a+1,a+n+1);
	get_tim();
	reverse(a+1,a+n+1),reverse(tim+1,tim+n+1);
	For(i,1,n) de[i].clear();
	For(i,1,n) de[tim[i]].pb(i);
	solve(-1);
	
	For(i,1,m) printf("%d\n",max(res[i],0));
	return 0;
}
/*
*/