#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 998244353;

long long fac[200005], finv[200005], inv[200005];

void COMinit() {
    fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
    for (int i = 2; i < 200005; i++) {
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

long long COM(int n, int k){
    if(n == k) return 1;
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

int main() {
    string S;
    int A,B,C;
    cin >> S >> A >> B >> C;
    int a = 0,b = 0,c = 0;
    for(int i = 0; i < S.size(); i++) {
        if(S[i] == 'a') a++;
        if(S[i] == 'b') b++;
        if(S[i] == 'c') c++;
    }
    COMinit();
    A -= a;
    B -= b;
    C -= c;
    int ans = 0;
    for(int i = 0; i <= A+B; i++) {
        for(int j = 0; j <= A && j <= i; j++) {
            if(i-j > B) continue;
            for(int k = 0; k <= i; k++) {
                ans += COM(i,j)*COM(i+c-k-1,c-1)%mod*COM(A-j+b-1,b-1)%mod*COM(B-(i-j)+a-1,a-1)%mod*COM(C+a+b+k+(A+B-i),a+b+(A+B-i)+k)%mod;
                ans %= mod;
            }
        }
    }
    cout << ans << endl;
}