#include<bits/stdc++.h>

using namespace std;
#define ll long long

const int N = 2e5 + 100;
const ll mod = 1e9 + 7;

ll n, Q;
ll na, nb, nc;
ll dp[3][310][310], nxt[3][310][310];
ll sum[310][310];
string str;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);

    cin >> n >> Q;
    cin >> str;
    str = "X" + str;

    for (int i = 1; i <= n; i++) {
        if (str[i] == 'a') na++;
        if (str[i] == 'b') nb++;
        if (str[i] == 'c') nc++;
    }
    if (str[1] == '?') dp[0][1][0] = dp[1][0][1] = dp[2][0][0] = 1;
    if (str[1] == 'a') dp[0][1][0] = 1;
    if (str[1] == 'b') dp[1][0][1] = 1;
    if (str[1] == 'c') dp[2][0][0] = 1;

    for (int i = 2; i <= n; i++) {
        for (int a = 0; a <= i - 1; a++) {
            for (int b = 0; a + b <= i - 1; b++) {
                int c = i - a - b - 1;
                if (str[i] == 'a') {
                    nxt[0][a + 1][b] += dp[1][a][b] + dp[2][a][b];
                    nxt[0][a + 1][b] %= mod;
                }
                if (str[i] == 'b') {
                    nxt[1][a][b + 1] += dp[0][a][b] + dp[2][a][b];
                    nxt[1][a][b + 1] %= mod;
                }
                if (str[i] == 'c') {
                    nxt[2][a][b] += dp[0][a][b] + dp[1][a][b];
                    nxt[2][a][b] %= mod;
                }
                if (str[i] == '?') {
                    nxt[0][a + 1][b] += dp[1][a][b] + dp[2][a][b];
                    nxt[1][a][b + 1] += dp[0][a][b] + dp[2][a][b];
                    nxt[2][a][b] += dp[0][a][b] + dp[1][a][b];
                    nxt[0][a + 1][b] %= mod;
                    nxt[1][a][b + 1] %= mod;
                    nxt[2][a][b] %= mod;
                }
            }
        }

        for (int a = 0; a <= i; a++) {
            for (int b = 0; a + b <= i; b++) {
                for (int k = 0; k <= 2; k++) {
                    dp[k][a][b] = nxt[k][a][b] % mod;
                    nxt[k][a][b] = 0;
                }
            }
        }
    }

    for (int i = 0; i <= n; i++) {
        sum[i][0] = dp[0][i][0] + dp[1][i][0] + dp[2][i][0];
        for (int j = 1; j <= n; j++) {
            sum[i][j] = sum[i][j - 1];
            for (int l = 0; l <= 2; l++)
                sum[i][j] += dp[l][i][j];
        }
    }

    while (Q--) {
        ll x, y, z;
        ll ans = 0;
        cin >> x >> y >> z;
        x += na, y += nb, z += nc;
        for (int a = na; a <= min(n, x); a++) {
            if (n - z - a > y) continue;
            ans += sum[a][min(n, y)];
            if (n - z - a - 1 >= 0) ans -= sum[a][n - z - a - 1];
        }

        cout << ans << "\n";
    }


    return 0;
}

/*
6 3
a?b??c
2 2 2
1 1 1
1 0 2

6 3
??????
2 2 2
2 3 3
3 3 3
 */