/*

Author: Haze

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll readL() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

inline int read() {
    return (int) (readL());
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

ll f[303][303][3], g[303][303][3];
ll pre[303][303];
void solve() {
    int n = read(), q = read();
    string s;
    cin >> s;
    s = " " + s;
    int qr = count(s.begin(), s.end(), '?');
    irep(i, 1, n - 1) {
        if (s[i] == s[i + 1] and (s[i] == 'a' or s[i] == 'b' or s[i] == 'c')) {
            irep(j, 1, q)cout << 0 << '\n';
            return;
        }
    }
    if (s[1] == '?') {
        f[1][0][0] = f[0][1][1] = f[0][0][2] = 1;
    }
    if (s[1] == 'a')f[0][0][0] = 1;
    if (s[1] == 'b')f[0][0][1] = 1;
    if (s[1] == 'c')f[0][0][2] = 1;
    swap(f, g);
    int que = 0;
    if(s[1] == '?')++ que;

    irep(i, 2, n) {

        if (s[i] == 'a') {
            irep(a, 0, que) {
                irep(b, 0, que - a) {
                    int c = que - a - b;
                    f[a][b][0] = g[a][b][1] + g[a][b][2];
                    if (f[a][b][0] >= mod)f[a][b][0] -= mod;
                }
            }
        }
        if (s[i] == 'b') {
            irep(a, 0, que) {
                irep(b, 0, que - a) {
                    int c = que - a - b;
                    f[a][b][1] = g[a][b][0] + g[a][b][2];
                    if (f[a][b][1] >= mod)f[a][b][1] -= mod;
                }
            }
        }
        if (s[i] == 'c') {
            irep(a, 0, que) {
                irep(b, 0, que - a) {
                    int c = que - a - b;
                    f[a][b][2] = g[a][b][0] + g[a][b][1];
                    if (f[a][b][2] >= mod)f[a][b][2] -= mod;
                }
            }
        }
        if (s[i] == '?') {
            irep(a, 0, que) {
                irep(b, 0, que - a) {
                    int c = que - a - b;
                    f[a + 1][b][0] = g[a][b][1] + g[a][b][2];
                    f[a][b + 1][1] = g[a][b][0] + g[a][b][2];
                    f[a][b][2] = g[a][b][0] + g[a][b][1];
                    if (f[a + 1][b][0] >= mod)f[a + 1][b][0] -= mod;
                    if (f[a][b + 1][1] >= mod)f[a][b + 1][1] -= mod;
                    if (f[a][b][2] >= mod)f[a][b][1] -= mod;
                }
            }
        }
        if(s[i] == '?') ++ que;
        swap(f, g);
        memset(f, 0, sizeof f);
//        irep(ii, 0, 3){
//            irep(jj, 0, 3){
//                cerr << g[ii][jj][0] << ' ';
//            }
//            cerr<<endl;
//        }
    }

    irep(i, 0, 300){
        irep(j, 0, 300){
            pre[i][j] = (g[i][j][0] + g[i][j][1] + g[i][j][2]) % mod;
            if(j)pre[i][j] += pre[i][j - 1];
            pre[i][j] %= mod;
        }
    }
    while(q --){
        int a = read(), b = read(), c = read();
        ll ans = 0;
        for(int x = 0; x <= a; ++ x){
            int L = qr - x - c, R = b;
//            cerr << L << ' ' << R << endl;
            L = max(L, 0);
            if(L <= R){
                ans += pre[x][R];
                if(L)ans -= pre[x][L - 1];
                ans %= mod;
            }
        }
        cout << (ans + mod) % mod << '\n';
    }

}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}