#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll int
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
vector<ll> vec[500050],V[500050];
pair<ll,ll> st[2][500050];
ll t,n,q,a[500050],top[2],tree[500050],ans[500050];
char s[500050];
struct node{
	ll l,r,k;
}p[500050];
il ll lowbit(ll x){
	return x&(-x);
}
il void mdf(ll x,ll v){
	while(x<=n){
		tree[x]+=v;
		x+=lowbit(x);
	}
}
il ll query(ll x){
	ll res=0;
	while(x){
		res+=tree[x];
		x-=lowbit(x);
	}
	return res;
}
il void ins(bl o,ll v){
	if(!top[o]) st[o][++top[o]]=MP(v,v);
	else if(v<(st[o][top[o]].fir-1)) st[o][++top[o]]=MP(v,v);
	else if(v==(st[o][top[o]].fir-1)) st[o][top[o]].fir=v;
	else if(v==(st[o][top[o]].sec+1)){
		st[o][top[o]].sec=v;
		if(top[o]>1&&st[o][top[o]].sec==(st[o][top[o]-1].fir-1)){
			st[o][top[o]-1].fir=st[o][top[o]].fir;
			top[o]--;
		}
	}
}
il ll del(bl o){
	ll res=st[o][top[o]].fir;
	st[o][top[o]].fir++;
	if(st[o][top[o]].fir>st[o][top[o]].sec) top[o]--;
	return res;
}
int main(){
	n=read();
	q=read();
	scanf("%s",s+1);
	fr(i,1,n) a[i]=(s[i]=='1');
	fr(i,1,q){
		p[i].l=read();
		p[i].r=read();
		p[i].k=min(n,read());
		vec[p[i].k].push_back(i);
	}
	top[0]=top[1]=1;
	st[0][1]=st[1][1]=MP(1,n+1);
	fr(i,1,n){
		ll pos=del(a[i]);
		ins(a[i]^1,pos);
		V[pos].push_back(i);
	}
	pfr(i,n,0){
		fr(j,0,(ll)vec[i].size()-1) ans[vec[i][j]]+=query(p[vec[i][j]].r);
		fr(j,0,(ll)V[i].size()-1) mdf(V[i][j],1);
	}
	fr(i,0,n) V[i].clear();
	fr(i,1,n) tree[i]=0;
	top[0]=top[1]=1;
	st[0][1]=st[1][1]=MP(1,n+1);
	pfr(i,n,1){
		ll pos=del(a[i]);
		ins(a[i]^1,pos);
		V[pos].push_back(i);
	}
	pfr(i,n,0){
		fr(j,0,(ll)vec[i].size()-1) ans[vec[i][j]]-=query(p[vec[i][j]].l-1);
		fr(j,0,(ll)V[i].size()-1) mdf(V[i][j],1);
	}
	fr(i,0,n) V[i].clear();
	fr(i,1,n) tree[i]=0;
	fr(i,1,q) writeln(max(0,ans[i]));
}