//https://contest.ucup.ac/contest/1821/problem/9536?v=1
//f[i][x][y][p] : 考虑前i个字符，使用j个a，k个b，并且最后一个字符是p
#include<bits/stdc++.h>
using namespace std;
const int maxn = 305;
int n , q;
string c, s;
int f[maxn][maxn][maxn][3];
int g[maxn][maxn][maxn];
int cnt[3];
const int mod = 1e9 + 7;
signed main(){
    cin >> n >> q;
    cin >> c;
    s = "0";
    s += c;

    for(int i = 1 ; i <= n;i++){
        if(s[i]!='?')cnt[ (int)(s[i] - 'a') ]++; 
    }


    if(s[1] == '?'){
        f[1][2][1][0] = 1;
        f[1][1][2][1] = 1;
        f[1][1][1][2] = 1;

    }
    else{
        if(s[1] == 'a')f[1][2][1][0] = 1;
        if(s[1] == 'b')f[1][1][2][1] = 1;
        if(s[1] == 'c')f[1][1][1][2] = 1;
    }

    for(int i = 2; i <= n ;i ++){
        for(int x = 1 ; x <= i + 1 ; x++){
            for(int y = 1 ; x + y <= i + 2; y++ ){
                // cout <<  "fdassdas" << endl;
                int z = i + 3 - x - y;

                if(s[i] != '?'){
                    if(s[i] == 'a' && x >= 1){
                        //f[1][2][1][0]
                        f[i][x][y][0] = ( f[i - 1][x - 1][y][1] + f[i - 1][x - 1][y][2]) % mod ;
                    }
                    else if ( s[i] == 'b' && y >= 1 ){
                        f[i][x][y][1] = (f[i - 1][x][y - 1][0] + f[i - 1][x][y - 1][2])% mod ;
                    }
                    else if ( s[i] == 'c' && z >= 1 ){
                        f[i][x][y][2] = (f[i - 1][x][y][0] + f[i - 1][x][y][1] ) % mod;
                    }
                }
                else{
                    if(s[i - 1] != 'a' && x >= 1  ){//can select a
                        f[i][x][y][0] = (  f[i - 1][x - 1][y][1] + f[i - 1][x - 1][y][2]) % mod;
                    }
                    if(s[i - 1] != 'b' && y >= 1){//can select b
                        f[i][x][y][1] = (f[i - 1][x][y - 1][0]  + f[i - 1][x][y - 1][2]) % mod;
                    }
                    if(s[i - 1] != 'c' && z >= 1){//can select c
                        f[i][x][y][2] = (f[i - 1][x][y][0] + f[i - 1][x][y][1] ) % mod;
                    }
                }


            }
        }
    }


    // cout << f[6][3][3][2] << endl;
    for(int x = 1 ; x <= n + 1; x++){
        for(int y = 1 ;y <= n + 1; y++){
            for(int z = 1 ; z <= n + 1 ; z++){

                int res = 0;
                for(int  i = 0 ; i <= 2 ; i++){
                    res = ( res + f[n][x][y][i])% mod;
                }
                // cout << res << endl;

                g[x][y][z] = (g[x-1][y][z] + g[x][y-1][z] + g[x][y][z-1] - g[x-1][y-1][z]-g[x-1][y][z-1]-g[x][y-1][z-1] + g[x-1][y-1][z-1] )%mod;
                if(x + y + z == n + 3){
                    g[x][y][z] = (g[x][y][z] + res) % mod;
                }
                // cout << g[x][y][z] << endl;
            }



        }
    }

    while(q--){
        int x,y,z;
        cin >> x >> y >> z;
        cout << g[x + 1 + cnt[0] ][y + 1 + cnt[1] ][z + 1 + cnt[2] ]<< endl;
    }

    return 0;
}