#include <bits/stdc++.h>

using namespace std;
using i64 = long long;
i64 dp[305][305][305][3];
i64 prefix[305][305][305] = {0};
// i64 p = 1e9 + 7;

void solve() {
    char c[305] = {0};
    i64 n, m;
    cin >> n >> m;
    for (i64 i = 1; i <= n; i++) {
        cin >> c[i];
    }
    
    i64 qianzhuihe[305] = {0};
    for (i64 i = 1; i <= n; i++) {
        if (c[i] == '?')
            qianzhuihe[i] = qianzhuihe[i - 1] + 1;
        else 
            qianzhuihe[i] = qianzhuihe[i - 1];
    }
    
    if (c[1] == 'a') {
        dp[1][0][0][0] = 1;
    }
    if (c[1] == 'b') {
        dp[1][0][0][1] = 1;
    }
    if (c[1] == 'c') {
        dp[1][0][0][2] = 1;
    }
    if (c[1] == '?') {
        if (c[2] == '?') {
            dp[1][1][0][0] = 1;
            dp[1][0][1][1] = 1;
            dp[1][0][0][2] = 1;
        }
        if (c[2] == 'a') {
            dp[1][0][1][1] = 1;
            dp[1][0][0][2] = 1;
        }
        if (c[2] == 'b') {
            dp[1][1][0][0] = 1;
            dp[1][0][0][2] = 1;
        }
        if (c[2] == 'c') {
            dp[1][1][0][0] = 1;
            dp[1][0][1][1] = 1;
        }
    }
    
    for (i64 i = 2; i <= n; i++) {
        for (i64 j = 0; j <= qianzhuihe[i]; j++) {
            for (i64 k = 0; k+j <= qianzhuihe[i]; k++) {
                if (c[i] == 'a') {
                    dp[i][j][k][0] = (dp[i - 1][j][k][1] + dp[i - 1][j][k][2]) ;
                    continue;
                }
                if (c[i] == 'b') {
                    dp[i][j][k][1] = (dp[i - 1][j][k][0] + dp[i - 1][j][k][2]) ;
                    continue;
                }
                if (c[i] == 'c') {
                    dp[i][j][k][2] = (dp[i - 1][j][k][1] + dp[i - 1][j][k][0]) ;
                    continue;
                }
                if (c[i - 1] == 'a' || c[i + 1] == 'a')
                    dp[i][j][k][0] = 0;
                else if (j > 0)
                    dp[i][j][k][0] = (dp[i - 1][j - 1][k][1] + dp[i - 1][j - 1][k][2]) ;
                
                if (c[i - 1] == 'b' || c[i + 1] == 'b')
                    dp[i][j][k][1] = 0;
                else if (k > 0)
                    dp[i][j][k][1] = (dp[i - 1][j][k - 1][0] + dp[i - 1][j][k - 1][2]) ;
                
                if (c[i - 1] == 'c' || c[i + 1] == 'c')
                    dp[i][j][k][2] = 0;
                else if (j + k < qianzhuihe[i])
                    dp[i][j][k][2] = (dp[i - 1][j][k][1] + dp[i - 1][j][k][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 == qianzhuihe[n]) {
                    prefix[i][j][k] = dp[n][i][j][0] + dp[n][i][j][1] + dp[n][i][j][2];
                } else {
                    prefix[i][j][k] = 0;
                }
                if (i > 0) prefix[i][j][k] = (prefix[i][j][k] + prefix[i - 1][j][k]);
                if (j > 0) prefix[i][j][k] = (prefix[i][j][k] + prefix[i][j - 1][k]) ;
                if (k > 0) prefix[i][j][k] = (prefix[i][j][k] + prefix[i][j][k - 1]) ;
                if (i > 0 && j > 0) prefix[i][j][k] = (prefix[i][j][k] - prefix[i - 1][j - 1][k] ) ;
                if (i > 0 && k > 0) prefix[i][j][k] = (prefix[i][j][k] - prefix[i - 1][j][k - 1] );
                if (j > 0 && k > 0) prefix[i][j][k] = (prefix[i][j][k] - prefix[i][j - 1][k - 1] );
                if (i > 0 && j > 0 && k > 0) prefix[i][j][k] = (prefix[i][j][k] + prefix[i - 1][j - 1][k - 1]) ;
            }
        }
    }
    
    while (m--) {
        i64 a, b, c;
        cin >> a >> b >> c;
        cout << prefix[a][b][c]%1000000007 << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    i64 T = 1;
    // cin >> T;
    while (T--)
        solve();

    return 0;
}