#include<bits/stdc++.h>
#include<bits/extc++.h>
// #define int long long
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)

using namespace __gnu_pbds;
using namespace std;

const int N=3e2+1,mod=998244353;

int dp[2][N][N][N][3];
int n,m;

long long cnt;

void sol(int cases){
    cin>>n>>m;

    string str;
    cin>>str;
    
    int fs=0;
    for(auto v:str){
        if(v=='?') fs++;
    }


    str=" "+str;



    vector<array<int,5>>L,R;

    int sum=0;
    if(str[1]=='a'){
        dp[1][0][0][0][0]=1;
        L.push_back({1,0,0,0,0});
    }else if(str[1]=='b'){
        dp[1][0][0][0][1]=1;
        L.push_back({1,0,0,0,1});
    }else if(str[1]=='c'){
        dp[1][0][0][0][2]=1;
        L.push_back({1,0,0,0,2});
    }else{
        sum++;
        dp[1][1][0][0][0]=1;
        dp[1][0][1][0][1]=1;
        dp[1][0][0][1][2]=1;
        L.push_back({1,1,0,0,0});
        L.push_back({1,0,1,0,1});
        L.push_back({1,0,0,1,2});
    }


    for(int i=1;i<str.size()-1;++i){
        int u=(i%2),v=((i%2)^1);
        for(int s1=0;s1<=sum;++s1){
            for(int s2=0;s2<=sum-s1;++s2){
                int s3=sum-s1-s2;
                if(str[i+1]=='?'){
                    cnt=0;
                    cnt=(cnt+dp[u][s1][s2][s3][1]+dp[u][s1][s2][s3][2])%mod;
                    dp[v][s1+1][s2][s3][0]=(dp[v][s1+1][s2][s3][0]+cnt)%mod;
                    R.push_back({v,s1+1,s2,s3,0});

                    cnt=0;
                    cnt=(cnt+dp[u][s1][s2][s3][0]+dp[u][s1][s2][s3][2])%mod;
                    dp[v][s1][s2+1][s3][1]=(cnt+dp[v][s1][s2+1][s3][1])%mod;
                    R.push_back({v,s1,s2+1,s3,1});

                    cnt=0;
                    cnt=(cnt+dp[u][s1][s2][s3][0]+dp[u][s1][s2][s3][1]);
                    dp[v][s1][s2][s3+1][2]=(cnt+dp[v][s1][s2][s3+1][2])%mod;
                    R.push_back({v,s1,s2,s3+1,2});
                }else if(str[i+1]=='a'){
                    cnt=0;
                    cnt=(dp[u][s1][s2][s3][1]+dp[u][s1][s2][s3][2])%mod;
                    dp[v][s1][s2][s3][0]=(cnt+dp[v][s1][s2][s3][0])%mod;
                    R.push_back({v,s1,s2,s3,0});
                }else if(str[i+1]=='b'){
                    cnt=0;
                    cnt=(cnt+dp[u][s1][s2][s3][0]+dp[u][s1][s2][s3][2])%mod;
                    dp[v][s1][s2][s3][1]=(cnt+dp[v][s1][s2][s3][1])%mod;
                    R.push_back({v,s1,s2,s3,1});
                }else{
                    cnt=0;
                    cnt=(cnt+dp[u][s1][s2][s3][0]+dp[u][s1][s2][s3][1]);
                    dp[v][s1][s2][s3][2]=(cnt+dp[v][s1][s2][s3][2])%mod;
                    R.push_back({v,s1,s2,s3,2});
                }
            }
        }
        if(str[i+1]=='?'){
            sum++;
        }
        for(auto &[s1,s2,s3,s4,s5]:L) dp[s1][s2][s3][s4][s5]=0;
        L.clear();
        swap(L,R);
    }
    
    int k=(n%2);

    for(int s=0;s<=2;++s){
        for(int i=0;i<N;++i){
            for(int j=0;j<N;++j){
                for(int l=0;l<N;++l){
                    if(i+j+l!=sum) {
                        dp[k][i][j][l][s]=0;
                    }else{
                        // cout<<i<<' '<<j<<' '<<l<<' '<<s<<' '<<dp[k][i][j][l][s]<<'\n';
                    }
                }
            }
        }
    }


    for(int s=0;s<=2;++s){
        for(int i=0;i<N;++i){
            for(int j=0;j<N;++j){
                for(int l=0;l<N;++l){
                    cnt=0;
                    if(i-1>=0)
                        cnt+=dp[k][i-1][j][l][s];

                    if(j-1>=0)
                        cnt+=dp[k][i][j-1][l][s];

                    if(l-1>=0)
                        cnt+=dp[k][i][j][l-1][s];

                    if(i-1>=0&&j-1>=0)
                        cnt-=dp[k][i-1][j-1][l][s];

                    if(i-1>=0&&l-1>=0)
                        cnt-=dp[k][i-1][j][l-1][s];

                    if(j-1>=0&&l-1>=0)
                        cnt-=dp[k][i][j-1][l-1][s];
                    
                    if(i-1>=0&&j-1>=0&&l-1>=0)
                        cnt+=dp[k][i-1][j-1][l-1][s];

                    cnt%=mod;
                    dp[k][i][j][l][s]=(cnt+dp[k][i][j][l][s])%mod;
                }
            }
        }
    }


    while(m--){
        int a,b,c;
        cin>>a>>b>>c;

        if(fs==0){
            cout<<0<<'\n';
            continue;
        }

        long long res=0;
        if(str[n]=='?'||str[n]=='a'){
            res+=dp[k][a][b][c][0];
            res%=mod;
            // cout<<dp[k][a][b][c][0]<<'\n';
        }
        if(str[n]=='?'||str[n]=='b'){
            res+=dp[k][a][b][c][1];
            res%=mod;
            // cout<<dp[k][a][b][c][1]<<'\n';
        }
        if(str[n]=='?'||str[n]=='c'){
            res+=dp[k][a][b][c][2];
            res%=mod;
            // cout<<dp[k][a][b][c][2]<<'\n';
        }
        cout<<res<<'\n';
    }
}
       
signed main(){
    IOS;
    int _=1;
    // cin>>_;
    for(int i=1;i<=_;++i){
        sol(i);
    }
    return 0;
}