#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=2e9+1;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

const int mod = MOD9;
const int max_n = 200005;
struct mint {
  ll x; // typedef long long ll;
  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;
  }
  bool operator==(const mint &p) const { return x == p.x; }
  bool operator!=(const mint &p) const { return x != p.x; }
  // for prime mod
  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, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
using vm=vector<mint>;
using vvm=vector<vm>;
ll mex(ll a,ll b){
  rep(i,3){
    if(i!=a&&i!=b)return i;
  }
  return inf;
}
typedef string::const_iterator State;
struct perser{
    vm number(State &begin){
        vm ret(3);
        if(isdigit(*begin)){
          ret[*begin-'0']+=1;
        }
        else{
          rep(i,3)ret[i]+=1;
        }
        begin++;
        return ret;
    }
    vm factor(State &begin){
        if(*begin=='m'){
            begin++;
            auto t=*begin;
            begin++;
            begin++;
            begin++;
            vm left=factor(begin);
            begin++;
            vm right=factor(begin);
            begin++;
            //rep(i,3)cout << left[i] <<" ";cout << endl;
            //rep(i,3)cout << right[i] <<" ";cout << endl;
            vm ret(3);
            if(t=='a'||t=='?'){
              rep(i,3)rep(j,3){
                ret[max(i,j)]+=left[i]*right[j];
              }
            }
            if(t=='e'||t=='?'){
              rep(i,3)rep(j,3){
                ret[mex(i,j)]+=left[i]*right[j];
              }
            }
            return ret;
        }
        else return number(begin);
    }
    /*ll expression(State &begin){
        ll ret=factor(begin);
        while(1){
            if(*begin=='+'){
                begin++;
                ret+=term(begin);
            }
            else if(*begin=='-'){
                begin++;
                ret-=term(begin);
            }
            else break;
        }
        return ret;
    }*/
};

int main(){
  string s;cin >> s;
  State begin=s.begin();
  perser ps;
  auto ans=ps.factor(begin);
  ll k;cin >> k;
  //rep(i,3)cout << ans[i] <<" ";cout << endl;
  cout << ans[k] << endl;
}