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

const int mod = 1e9+7;
int dp[3][301][301][301];
int pre[302][302][302];
int f[3][3], nf[3][3]{{1,1,1},{1,1,1},{1,1,1}};
void solve() {
    for (int i = 0; i < 3; i++) {
        f[i][i] = 1;
        nf[i][i] = 0;
    }
    int n, q;
    string s;
    cin >> n >> q >> s;
    array<int , 3> vc{};
    s = ' ' + s;
    for (int i = 1; i <= n; i++) {
        if (s[i] != '?') vc[s[i] - 'a']++;
    }
    if (s[1] == '?') {
        for (int i = 0; i < 3; i++) {
            dp[i][f[i][0]][f[i][1]][f[i][2]] = 1;
        }
    } else {
        int p = s[1] - 'a';
        dp[p][f[p][0]][f[p][1]][f[p][2]] = 1;
    }
    auto dd = [&](int l, int a, int b, int c) -> ll {
        if (a >= 0 && b >= 0 && c >= 0) return dp[l][a][b][c];
        return 0;
    };

    for (int l = 1; l <= n; ++l) {
        for (int i = 0; i <= l; i++) {
            for (int j = 0; j + i <= l; j++) {
                int k = l - i - j;
                if (s[l] == '?') {
                    for (int now = 0; now < 3; now++) {
                        for (int p = 0; p < 3; p++) {
                            if (p != now) (dp[now][i][j][k] += dd(p, i - f[now][0], j - f[now][1], k - f[now][2])) %= mod;
                        }
                    }
                } else {
                    int now = s[l] - 'a';
                    for (int p = 0; p < 3; p++) {
                        if (p != now) (dp[now][i][j][k] += dd(p, i - f[now][0], j - f[now][1], k - f[now][2])) %= mod;
                    }
                }
            }
        }
    }


    auto pp = [&](int a, int b, int c) -> ll {
        if (a >= 0 && b >= 0 && c >= 0) return pre[a][b][c];
        return 0;
    };
    for (int i = 0; i <= 300; i++) {
        for (int j = 0; j <= 300; j++) {
            for (int k = 0; k <= 300; k++) {
                if (i + j + k == n) for (int l = 0; l < 3; l++) {
                    (pre[i][j][k] += dp[l][i][j][k]) %= mod;
                }

                for (int l = 0; l < 3; l++) {
                    (pre[i][j][k] += pp(i - f[l][0], j - f[l][1], k - f[l][2])) %= mod;
                }
                for (int l = 0; l < 3; l++) {
                    (pre[i][j][k] += mod - pp(i - nf[l][0], j - nf[l][1], k - nf[l][2])) %= mod;
                }
                (pre[i][j][k] += pp(i - 1, j - 1, k - 1) ) %= mod;

            }
        }
    }

    while (q--) {
        int a, b, c;
        cin >> a >> b >> c;
        a += vc[0];
        b += vc[1];
        c += vc[2];
        cout << pre[a][b][c] << '\n';
    }



}

int main( )
{
    int T = 1;
    while (T--) {
        solve();
    }

    return 0;

}