#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define debug(a) cout<<a<<'\n'
#define Pll pair<ll,ll>
#define PII pair<int,int>
#define ft first
#define sd second
#define vec vector
#define pushk push_back
#define ump unordered_map
#define pl p<<1
#define pr p<<1|1
using namespace std;
const int N = 3e2 + 10, M = 2e6 + 10, mod = 1e9+7;
const ll inf = 1e18;
const ld eps = 1e-13;
int mov[4][2] = { {0,1},{1,0},{-1,0},{0,-1} }, dx, dy, _ = 1, __ = 1;
void bout(bool f) {
    if (f)cout << "YES\n";
    else cout << "NO\n";
}
ll n, m, k;
ll dp[N][N][3],pre[N][N][3],sum[N][N][N];

void ini() {

}
void solve() {
    cin>>n>>m;
    string s;
    cin>>s;
    ll x,y,z,bx,by,bz;
    s='#'+s;
    if(s[1]=='a')dp[1][0][0]=1;
    else if(s[1]=='b')dp[0][1][1]=1;
    else if(s[1]=='c')dp[0][0][2]=1;
    else {
        dp[1][0][0]=dp[0][1][1]=dp[0][0][2]=1;
    }
    for(int c=2;c<=n;c++) {
        memcpy(pre,dp,sizeof dp);
        for(int i=0;i<=c;++i) {
            for(int j=0;j<=c;++j) {
                dp[i][j][0]=dp[i][j][1]=dp[i][j][2]=0;
                if(s[c]=='a') {
                    if(i)dp[i][j][0]=(dp[i][j][0]+pre[i-1][j][1]+pre[i-1][j][2])%mod;
                }
                else if(s[c]=='b') {
                    if(j)dp[i][j][1]=(dp[i][j][1]+pre[i][j-1][0]+pre[i][j-1][2])%mod;
                }
                else if(s[c]=='c') {
                    if(c-(i+j)>0)dp[i][j][2]=(dp[i][j][2]+pre[i][j][0]+pre[i][j][1])%mod;
                }
                else {
                    if(i)dp[i][j][0]=(dp[i][j][0]+pre[i-1][j][1]+pre[i-1][j][2])%mod;
                    if(j)dp[i][j][1]=(dp[i][j][1]+pre[i][j-1][0]+pre[i][j-1][2])%mod;
                    if(c-(i+j)>0)dp[i][j][2]=(dp[i][j][2]+pre[i][j][0]+pre[i][j][1])%mod;
                }
            }
        }
    }
    for(int i=1;i<=n+1;++i) {
        for(int j=1;j<=n+1;++j) {
            for(int k=1;k<=n+1;++k) {
                if(k-1==n-(i-1+j-1))sum[i][j][k]=dp[i-1][j-1][0]+dp[i-1][j-1][1]+dp[i-1][j-1][2];
                sum[i][j][k]=(sum[i][j][k]+sum[i-1][j][k]+sum[i][j-1][k]+sum[i][j][k-1]
                    -sum[i-1][j-1][k]-sum[i][j-1][k-1]-sum[i-1][j][k-1]+sum[i-1][j-1][k-1])%mod;
            }
        }
    }
    ll ans,res;
    bx=by=bz=0;
    for(int i=1;i<=n;++i) {
        if(s[i]=='a')++bx;
        else if(s[i]=='b')++by;
        else if(s[i]=='c')++bz;
    }
    for(int t=1;t<=m;++t) {
        cin>>x>>y>>z;
        x=min(x+bx,n);y=min(y+by,n);z=min(z+bz,n);
        ans=sum[x+1][y+1][z+1]%mod;
        ans=(ans%mod+mod)%mod;
        cout<<ans<<'\n';
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#ifndef ONLINE_JUDGE
    streambuf *cinbp=cin.rdbuf(),*coutbp=cout.rdbuf();
    ifstream fin("in.txt");
    ofstream fout("out.txt");
    cin.rdbuf(fin.rdbuf());
    cout.rdbuf(fout.rdbuf());
#endif
    //cin >> _;
    __ = _;
    ini();
    while (_--) {
        solve();
    }
    return 0;
}