#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const ll p = 1e9 + 7;
const ll MAXN = 301;
ll dp[MAXN][MAXN][MAXN][4];
ll g[MAXN][MAXN][MAXN];

ll n, t, q;
string c;
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> q;
    cin >> c;
    string s = "0" + c;

    ll cnt = 0;
    ll cnta = 0, cntb = 0, cntc = 0;


    for (ll i = 1; i <= n; i++) {
        if (s[i] == '?') cnt++;
        if (s[i] == 'a') cnta++;
        if (s[i] == 'b') cntb++;
        if (s[i] == 'c') cntc++;
        if (i == 1) {
            if (s[i] == 'a') {
                dp[1][0][0][1] = 1;
            }
            else if (s[i] == 'b') {
                dp[0][1][0][2] = 1;
            }
            else if (s[i] == 'c') {
                dp[0][0][1][3] = 1;
            }
            else {
                dp[1][0][0][1] = 1;
                dp[0][1][0][2] = 1;
                dp[0][0][1][3] = 1;
            }
        }
        else {
            for (ll a = 0; a <= i; a++) {
                for (ll b = 0; a + b <= i; b++) {
                    if (s[i] == 'a') {
                        if (a != 0) {
                            dp[a][b][i - a - b][1] = dp[a - 1][b][i - a - b][2] + dp[a - 1][b][i - a - b][3];
                            dp[a][b][i - a - b][1] %= p;
                        }

                    }
                    else if (s[i] == 'b') {
                        if (b != 0) {
                            dp[a][b][i - a - b][2] = dp[a][b - 1][i - a - b][1] + dp[a][b - 1][i - a - b][3];
                            dp[a][b][i - a - b][2] %= p;
                        }

                    }
                    else if (s[i] == 'c') {
                        if (i - a - b != 0) {
                            dp[a][b][i - a - b][3] = dp[a][b][i - a - b - 1][1] + dp[a][b][i - a - b - 1][2];
                            dp[a][b][i - a - b][3] %= p;
                        }
                    }
                    else {
                        if (a != 0) {
                            dp[a][b][i - a - b][1] = dp[a - 1][b][i - a - b][2] + dp[a - 1][b][i - a - b][3];
                            dp[a][b][i - a - b][1] %= p;
                        }
                        if (b != 0) {
                            dp[a][b][i - a - b][2] = dp[a][b - 1][i - a - b][1] + dp[a][b - 1][i - a - b][3];
                            dp[a][b][i - a - b][2] %= p;
                        }
                        if (i - a - b != 0) {
                            dp[a][b][i - a - b][3] = dp[a][b][i - a - b - 1][1] + dp[a][b][i - a - b - 1][2];
                            dp[a][b][i - a - b][3] %= p;
                        }
                    }
                }
            }
        }

    }
    // cout << dp[1][1][1][1] + dp[1][1][1][2] + dp[1][1][1][3];
    // for (ll x = 1; x <= n + 1; x++) {
    //     for (ll y = 1; y <= n + 1; y++) {
    //         for (ll z = 1; z <= n + 1; z++) {
    //             if (x + y + z > n + 3) break;
    //             g[x][y][z] = g[x - 1][y][z] + g[x][y - 1][z] + g[x][y][z - 1] - g[x][y - 1][z - 1] - g[x - 1][y][z - 1] - g[x - 1][y - 1][z] + g[x - 1][y - 1][z - 1];
    //             g[x][y][z] %= p;
    //             if (x + y + z == n + 3) {
    //                 g[x][y][z] += (dp[x][y][z][1] + dp[x][y][z][2] + dp[x][y][z][3]) % p;
    //                 g[x][y][z] %= p;
    //             }
    //         }
    //     }
    // }
    // for (ll i = 0; i <= n; i++) {
    //     for (ll j = 0; j <= n; j++) {
    //         for (ll k = 1; k <= 3; k++) {
    //             g[i+1][j+1][n-i-j+1]+=dp[]
    //         }
    //     }
    // }

    for (ll i = 0; i <= n; i++) {
        for (ll j = 0; j <= n; j++) {
            for (ll k = 0; k <= n; k++) {
                g[i][j][k] = g[max(i - 1, 0ll)][j][k] + g[i][max(j - 1, 0ll)][k] + g[i][j][max(0ll, k - 1)] - g[max(0ll, i - 1)][max(0ll, j - 1)][k] - g[max(0ll, i - 1)][j][max(0ll, k - 1)] - g[i][max(0ll, j - 1)][max(0ll, k - 1)] + g[max(0ll, i - 1)][max(0ll, j - 1)][max(0ll, k - 1)];
                g[i][j][k] %= p;
                if (i + j + k == n) {
                    ll now = 0;
                    for (ll t = 1; t <= 3; t++) {
                        now += dp[i][j][k][t];
                    }
                    g[i][j][k] += now;
                }
            }
        }
    }

    while (q--) {
        ll a, b, c;
        cin >> a >> b >> c;
        cout << g[a + cnta][b + cntb][c + cntc] << endl;
    }

    return 0;
}