#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> pii;
 
const int N=305,mod=1e9+7;
int n,q,c[3];
string a;
ll f[N][N][N][3],s[N][N][N];
 
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    cin>>n>>q>>a,a=" "+a;
    for(int i=1;i<=n;++i)if(a[i]!='?')++c[a[i]-'a'];
    f[1][0][0][0]=f[0][1][0][1]=f[0][0][1][2]=1;
    for(int i=0;i<=n;++i)
        for(int j=0;i+j<=n;++j)
            for(int k=0;i+j+k<=n;++k)if(i+j+k>0){
                if(i+j+k<n){
                    (f[i+1][j][k][0]+=f[i][j][k][1]+f[i][j][k][2])%=mod;
                    (f[i][j+1][k][1]+=f[i][j][k][0]+f[i][j][k][2])%=mod;
                    (f[i][j][k+1][2]+=f[i][j][k][0]+f[i][j][k][1])%=mod;
                }
            }
    for(int i=0;i<=n;++i)
        for(int j=0;j<=n;++j)
            for(int k=0;k<=n;++k){
                if(i+j+k==n)s[i][j][k]=f[i][j][k][0]+f[i][j][k][1]+f[i][j][k][2];
                if(i>0)s[i][j][k]+=s[i-1][j][k];
                if(j>0)s[i][j][k]+=s[i][j-1][k];
                if(k>0)s[i][j][k]+=s[i][j][k-1];
                if(i>0&&j>0)s[i][j][k]-=s[i-1][j-1][k];
                if(i>0&&k>0)s[i][j][k]-=s[i-1][j][k-1];
                if(j>0&&k>0)s[i][j][k]-=s[i][j-1][k-1];
                if(i>0&&j>0&&k>0)s[i][j][k]+=s[i-1][j-1][k-1];
                s[i][j][k]=(s[i][j][k]%mod+mod)%mod;
            }
    while(q--){
        int x,y,z;
        cin>>x>>y>>z;
        x=min(x+c[0],n),y=min(y+c[1],n),z=min(z+c[2],n);
        cout<<s[x][y][z]<<'\n';
    }
}