#include<bits/stdc++.h>
using namespace std;
using ll = long long;

const ll mod = 1e9+7;

void add(ll &a , ll b){
	a += b;
	a %= mod;
}

ll dp[301][301][301][3];

int main(){
	int N; cin >> N;
	int Q; cin >> Q;
	string S; cin >> S;
	for(int i = 0; i < 301; i++){
		for(int j = 0; j < 301; j++){
			for(int k = 0; k < 301; k++){
				for(int l = 0; l < 3; l++){
					dp[i][j][k][l] = 0;
				}
			}
		}
	}
	if(S[0] == '?'){
		dp[0][1][0][0] = 1;
		dp[0][0][1][1] = 1;
		dp[0][0][0][2] = 1;
	}
	else{
		if(S[0] == 'a')dp[0][1][0][0] = 1;
		if(S[0] == 'b')dp[0][0][1][1] = 1;
		if(S[0] == 'c')dp[0][0][0][2] = 1;
	}
	for(int i = 1; i < N; i++){
		for(int j = 0; j <= N; j++){
			for(int k = 0; k <= N; k++){
				for(int pre = 0; pre < 3; pre++){
					if(S[i] == '?'){
						if(j-1 >= 0 && pre != 0)add(dp[i][j][k][0] , dp[i-1][j-1][k][pre]);
						if(k-1 >= 0 && pre != 1)add(dp[i][j][k][1] , dp[i-1][j][k-1][pre]);
						if(pre != 2)add(dp[i][j][k][2] , dp[i-1][j][k][pre]);
					}
					else{
						ll d = S[i] - 'a';
						if(d == pre)continue;
						if(d == 0){
							if(j-1 >= 0)add(dp[i][j][k][0] , dp[i-1][j-1][k][pre]);
						}
						if(d == 1){
							if(k-1 >= 0)add(dp[i][j][k][1] , dp[i-1][j][k-1][pre]);
						}
						if(d == 2){
							add(dp[i][j][k][2] , dp[i-1][j][k][pre]);
						}
					}
				}
			}
		}
	}
	vector<vector<ll>> sum(N+2 , vector<ll>(N+2));
	for(int i = 0; i <= N; i++){
		for(int j = 0; j <= N; j++){
			add(sum[i][j+1] , sum[i][j]);
			for(int k = 0; k < 3; k++)add(sum[i][j+1] , dp[N-1][i][j][k]);
		}
	}
	int ba = 0, bb = 0, bc = 0;
	for(int i = 0; i < N; i++){
		if(S[i] == 'a')ba++;
		if(S[i] == 'b')bb++;
		if(S[i] == 'c')bc++;
	}
	while(Q--){
		int A,B,C; cin >> A >> B >> C;
		A += ba;
		B += bb;
		C += bc;
		ll ans = 0;
		for(int a = 0; a <= A; a++){
			if(B+1 <= N-a-C)continue;
			add(ans , sum[a][min(B+1,N+1)]);
			add(ans , mod - sum[a][max(0 , N-a-C)]);
		}
		cout << ans << '\n';
	}
	return 0;
}