#include <bits/stdc++.h>
using namespace std;
template<const int MOD> struct modint{
    long long val;
    modint(): val(0) {}
    modint(long long x){
        if(x < 0) val = x % MOD + MOD;
        else val = x % MOD;
    }
    modint(const modint &t){
        val = t.val;
    }
    modint& operator =(const modint m){
        val = m.val;
        return *this;
    }
    modint operator -(){
        return modint(-val);
    }
    modint& operator-=(const modint &m){
        val -= m.val;
        if(val < 0) val += MOD;
        return *this;
    }
    modint& operator+=(const modint &m){
        val += m.val;
        if(val >= MOD) val -= MOD;
        return *this;
    }
    modint& operator*=(const modint &m){
        val *= m.val;
        val %= MOD;
        return *this;
    }
    modint& operator/=(modint m){
        *this *= m.inv();
        return *this;
    }
    modint inv(){
        long long x = 1, y = 0;
        long long a = val, b = MOD;
        while(b != 0){
            long long t = a / b;
            a -= t * b;
            x -= t * y;
            swap(a, b);
            swap(x, y);
        }
        x %= MOD;
        if(x < 0) x += MOD;
        return modint(x);
    }
    modint pow(long long k){
        long long res = 1;
        long long v = val;
        while(k > 0){
            if(k & 1) res = res * v % MOD;
            v = v * v % MOD;
            k >>= 1;
    }
        return modint(res);
    }
    bool operator==(const modint &m){
        return val == m.val;
    }
    modint operator+(const modint &m){
        return modint(*this) += m;
    }
    modint operator-(const modint &m){
        return modint(*this) -= m;
    }
    modint operator*(const modint &m){
        return modint(*this) *= m;
    }
    modint operator/(const modint &m){
        return modint(*this) /= m;
    }
    bool operator!=(const modint &m){
        return modint(*this).val != m.val;
    }
    bool operator!=(const int &m){
        return modint(*this).val != m;
    }
};
const int MOD = 998244353;
using mint = modint<MOD>;
const int MAX = 410000;
mint fac[MAX], finv[MAX], inv[MAX];
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i;
        inv[i] = mint(MOD) - inv[MOD % i] * (MOD / i);
        finv[i] = finv[i - 1] * inv[i];
    }
}
mint COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * finv[k] * finv[n - k];
}
int main(){
    string S;
    cin >> S;
    int K;
    cin >> K;
    int N = S.size();
    vector<vector<mint>> dp(N + 1, vector<mint>(3));
    stack<int> s;
    vector<int> p(N, -1), mid(N, -1), op(N, -1);
    for(int i = 0; i < N; i++){
        if(S[i] == '(') {
            s.push(i);
            string T;
            for(int j = i - 3; j <= i - 1; j++){
                T += S[j];
            }
            if(T == "max") op[i] = 0;
            else if(T == "mex") op[i] = 1;
            else op[i] = 2;
        }
        else if(S[i] == ')'){
            p[s.top()] = i;
            s.pop();
        }
        else if(S[i] == ','){
            mid[s.top()] = i;
        }
    }
    auto dfs = [&](auto dfs, int l, int r)->void{
        if(r == l + 1){
            if(S[l] == '?'){
                for(int i = 0; i < 3; i++) dp[l][i] += 1;
            }
            else dp[l][S[l] - '0'] += 1;
            return;
        }
        if(S[l] == '('){
            dfs(dfs, l + 1, mid[l]);
            dfs(dfs, mid[l] + 1, r - 1);
            if(op[l] == 0){
                for(int i = 0; i < 3; i++){
                    for(int j = 0; j < 3; j++){
                        dp[l][max(i, j)] += dp[l + 1][i] * dp[mid[l] + 1][j];
                    }
                }
            }
            else if(op[l] == 1){
                for(int i = 0; i < 3; i++){
                    for(int j = 0; j < 3; j++){
                        vector<bool> f(3, true);
                        f[i] = false;
                        f[j] = false;
                        for(int k = 0; k < 3; k++){
                            if(f[k]){
                                dp[l][k] += dp[l + 1][i] * dp[mid[l] + 1][j];
                                break;
                            }
                        }
                    }
                }
            }
            else{
                for(int i = 0; i < 3; i++){
                    for(int j = 0; j < 3; j++){
                        vector<bool> f(3, true);
                        f[i] = false;
                        f[j] = false;
                        dp[l][max(i, j)] += dp[l + 1][i] * dp[mid[l] + 1][j];
                        for(int k = 0; k < 3; k++){
                            if(f[k]) {
                                dp[l][k] += dp[l + 1][i] * dp[mid[l] + 1][j];
                                break;
                            }
                        }
                    }
                }
            }
        }
        else{
            dfs(dfs, l + 1, r);
            dp[l] = dp[l + 1];
        }
    };
    dfs(dfs, 0, N);
    cout << dp[0][K].val << endl;
}