#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using VI = vector<int>;
using PII = pair<int,int>;
using VVI = vector<vector<int>>;
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const int N = 2e5 + 10;
void solve(){
	
}
int n;
int q;
string s;
ll dp[400][400][400][3];
ll sum[400][400];
int main() {
	ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
   //int T;cin>>T;while(T--)solve();
    //?????????????
    cin>>n>>q;
    cin>>s;
    s = " " + s;
    if(s[1] == '?'){
    	dp[1][1][0][0] = 1;
    	dp[1][0][1][1] = 1;
    	dp[1][0][0][2] = 1;
    }else{
    	if(s[1] == 'a') dp[1][1][0][0] = 1;
    	if(s[1] == 'b') dp[1][0][1][1] = 1;
    	if(s[1] == 'c') dp[1][0][0][2] = 1;
    }
    //cout<<dp[1][1][0][0];
    //dp[0][0][0][3] = 0;
    for(int i = 2 ; i <= n ; i++){
    	if(s[i] == '?'){
    		for(int a = 0 ; a <= i ; a++){
    			for(int b = 0 ; b <= i ; b++){
    				if(a >= 1) {
    					dp[i][a][b][0] += dp[i - 1][a - 1][b][1] + dp[i - 1][a - 1][b][2];
    					dp[i][a][b][0] %= mod;
    				}
    				if(b >= 1){
    					dp[i][a][b][1] += dp[i - 1][a][b - 1][0] + dp[i - 1][a][b - 1][2];
    					dp[i][a][b][1] %= mod;
    					
    				}
    				if(i - (a + b) >= 1){
    					dp[i][a][b][2] += dp[i - 1][a][b][0] + dp[i - 1][a][b][1];
    					dp[i][a][b][2] %= mod;
    				}
    				
    			}   			
    		}
    		
    		
    	}else{
    		for(int a = 0 ; a <= i ; a++){
    			for(int b = 0 ; b <= i ; b++){
    				if(s[i] == 'a'){
    					if(a >= 1) {
	    					dp[i][a][b][0] += dp[i - 1][a - 1][b][1] + dp[i - 1][a - 1][b][2];
	    					dp[i][a][b][0] %= mod;
	    				}
	    				dp[i][a][b][1] = 0;
	    				dp[i][a][b][2] = 0;
    				}
    				
    				if(s[i] == 'b'){
    					if(b >= 1){
	    					dp[i][a][b][1] += dp[i - 1][a][b - 1][0] + dp[i - 1][a][b - 1][2];
	    					dp[i][a][b][1] %= mod;
	    				}	
	    				dp[i][a][b][0] = 0;
	    				dp[i][a][b][2] = 0;
    					
    				}
    				
    				if(s[i] == 'c'){
    					if(i - (a + b) >= 1){
	    					dp[i][a][b][2] += dp[i - 1][a][b][0] + dp[i - 1][a][b][1];
	    					dp[i][a][b][2] %= mod;
	    				}
	    				dp[i][a][b][0] = 0;
	    				dp[i][a][b][1] = 0;
    				}
    				
    			}   			
    		}
    			
    	}
    }
    //acbabc
    /*cout<<dp[1][1][0][0]<<" ";
    cout<<dp[1][1][0][1]<<" ";
    cout<<dp[2][1][0][2]<<" ";
    cout<<endl;*/
    for(int a = 0 ; a <= n ; a++){
    	for(int b = 0 ; b <= n ; b++){
    		sum[a][b] += dp[n][a][b][0] + dp[n][a][b][1] + dp[n][a][b][2];
    		sum[a][b] %= mod;
    	}
    	for(int b = 1 ; b <= n ; b++){
    		sum[a][b] += sum[a][b - 1];
    		sum[a][b] %= mod;
    	}
    }
    
    VI t(26 , 0);
    for(int i = 1 ; i <= n ; i++){
    	if(s[i] == '?') continue;
    	t[s[i] - 'a']++;
    }
    
    while(q--){
    	int x,y,z;
    	cin>>x>>y>>z;
    	ll res = 0;
    	int rest = n - t[1] - t[2] - y - z;
    	for(int i = max(t[0] , rest) ; i <= min(t[0] + x , n) ; i++){
    		int L = max(t[1] , n - i - t[2] - z);
    		int R = min(n - i - t[2] , t[1] + y);
    		if(L > R) continue;
    		//cout<<i<<" "<<L<<" "<<R<<" ";
    		res += sum[i][R] - (L == 0 ? 0 : sum[i][L - 1]);
    		res %= mod;
    		//cout<<res<<" ";
    		//cout<<endl;
    	}
    	cout<<res<<'\n';
    }
    
    
    
    
}


//5 4 3 2 1
//5 4 3 2 1