#include<bits/stdc++.h>
using i64=long long;
using u64=unsigned long long;
using namespace std;

template<u64 mod> struct modint{
  u64 val;
  modint(i64 val_=0):val((val_%i64(mod)+i64(mod))%i64(mod)){}
  modint operator-(){
    return (val==0)?0:mod-val;
  }
  modint operator+(modint rhs){
    return modint(*this)+=rhs;
  }
  modint operator-(modint rhs){
    return modint(*this)-=rhs;
  }
  modint operator*(modint rhs){
    return modint(*this)*=rhs;
  }
  modint operator/(modint rhs){
    return modint(*this)/=rhs;
  }
  modint pow(i64 rhs){
    modint res=1,now=(*this);
    while(rhs){
      res*=((rhs&1)?now:1),now*=now,rhs>>=1;
    }
    return res;
  }
  modint &operator+=(modint rhs){
    val+=rhs.val,val-=((val>=mod)?mod:0);
    return (*this);
  }
  modint &operator-=(modint rhs){
    val+=((val<rhs.val)?mod:0),val-=rhs.val;
    return (*this);
  }
  modint &operator*=(modint rhs){
    val=val*rhs.val%mod;
    return (*this);
  }
  modint &operator/=(modint rhs){
    return (*this)*=rhs.pow(mod-2);
  }
  bool operator==(modint rhs){
    return val==rhs.val;
  }
  bool operator!=(modint rhs){
    return val!=rhs.val;
  }
  friend std::ostream &operator<<(std::ostream& os,modint x){
    return os<<(x.val);
  }
  friend std::istream &operator>>(std::istream& is,modint& x){
    u64 t;
    is>>t,x=t;
    return is;
  }
};

int main(){
  constexpr u64 mod=998244353;
  typedef modint<mod> mint;
  string S;
  int A,B,C;
  cin>>S>>A>>B>>C;
  assert(A<=80 && B<=80 && C<=80);
  int N=S.size();
  vector<array<array<array<mint,81>,81>,81>> dp(N+5);
  for(int i=0;i<=N;++i){
    for(int j=0;j<=80;++j){
      for(int k=0;k<=80;++k){
        for(int l=0;l<=80;++l){
          dp[i][j][k][l]=0;
        }
      }
    }
  }
  dp[0][0][0][0]=1;
  for(int s=0;s<A+B+C;++s){
    for(int a=0;a<=min(s,A);++a){
      for(int b=0;b<=min(s-a,B);++b){
        int c=s-a-b;
        if(C<c){
          continue;
        }
        for(int i=0;i<N;++i){
          if(S[i]=='a'){
            dp[i+1][a+1][b][c]+=dp[i][a][b][c];
            dp[i][a][b+1][c]+=dp[i][a][b][c];
            dp[i][a][b][c+1]+=dp[i][a][b][c];
          }
          if(S[i]=='b'){
            dp[i+1][a][b+1][c]+=dp[i][a][b][c];
            dp[i][a+1][b][c]+=dp[i][a][b][c];
            dp[i][a][b][c+1]+=dp[i][a][b][c];
          }
          if(S[i]=='c'){
            dp[i+1][a][b][c+1]+=dp[i][a][b][c];
            dp[i][a+1][b][c]+=dp[i][a][b][c];
            dp[i][a][b+1][c]+=dp[i][a][b][c];
          }
        }
        dp[N][a+1][b][c]+=dp[N][a][b][c];
        dp[N][a][b+1][c]+=dp[N][a][b][c];
        dp[N][a][b][c+1]+=dp[N][a][b][c];
      }
    }
  }
  cout<<dp[N][A][B][C]<<endl;
}