#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    typedef unsigned long long ull;
    using P=pair<ll,ll>;
    const ll INF=1e9;
    const int mod=998244353;
    
    struct mint {
      ll x; 
      mint(ll x=0):x((x%mod+mod)%mod){}
      mint operator-() const { return mint(-x);}
      mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
      }
      mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
      }
      mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
      mint operator+(const mint a) const { return mint(*this) += a;}
      mint operator-(const mint a) const { return mint(*this) -= a;}
      mint operator*(const mint a) const { return mint(*this) *= a;}
      mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
      }
       
      mint inv() const { return pow(mod-2);}
      mint& operator/=(const mint a) { return *this *= a.inv();}
      mint operator/(const mint a) const { return mint(*this) /= a;}
     };
      istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
      ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
      struct combination {
      vector<mint> fact, ifact;
      combination(int n):fact(n+1),ifact(n+1) {
        assert(n < mod);
        fact[0] = 1;
        for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
        ifact[n] = fact[n].inv();
        for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
      }
      mint operator()(int n, int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[k]*ifact[n-k];
      }
     } c(200005);

    int mex(int a,int b){
        rep(i,4){
            if(i!=a&&i!=b){
                return i;
            }
        }
    }

    string s;
    int k;
    int i;
    void dfs(mint res[]){
        if(s[i]=='m'){
            mint a[3]={};
            mint b[3]={};
            char c=s[i+1];
            i+=4;
            dfs(a);
            i++;
            dfs(b);
            i++;
            if(c=='a'||c=='?'){
                rep(x,3){
                    rep(y,3){
                        res[max(x,y)]+=a[x]*b[y];
                    }
                }
            }
            if(c=='e'||c=='?'){
                rep(x,3){
                    rep(y,3){
                        res[mex(x,y)]+=a[x]*b[y];
                    }
                }
            }
            return;
        }
        
        if(isdigit(s[i])){
            res[s[i]-'0']+=1;
            i++;
            return;
        }

        rep(k,3){
            res[k]+=1;
        }
        i++;
    }
    
    void solve(){
        cin>>s>>k;
        mint res[3]={};
        dfs(res);
        cout<<res[k]<<endl;
    }
 
    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve(); 

        return 0;
    }