#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint998244353;
string S;vector<P>Q(2e5);
ll mex(ll A,ll B){
  if(A>B)swap(A,B);if(A)return 0;if(B==1)return 2;return 1;
}
vector<mint>dfs(ll l,ll r){
  vector<mint>res(3);
  if(r-l==1){if(S[l]=='?'){res[0]++;res[1]++;res[2]++;}else res[S[l]-'0']++;}
  else{
    vector<mint>f=dfs(l+4,Q[l+3].F),s=dfs(Q[l+3].F+1,Q[l+3].S);
    if(S[l+1]!='a')REP(i,3)REP(j,3)res[mex(i,j)]+=f[i]*s[j];
    if(S[l+1]!='e')REP(i,3)REP(j,3)res[max(i,j)]+=f[i]*s[j];
  }
  return res;
}
signed main(){
  ll K;cin>>S>>K;stack<ll>s;
  REP(i,S.size()){
    if(S[i]=='(')s.push(i);if(S[i]==',')Q[s.top()].F=i;
    if(S[i]==')'){Q[s.top()].S=i;s.pop();}
  }
  cout<<dfs(0,S.size()).at(K).val()<<endl;
  return 0;
}