#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=998244353,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

string s;
ll dp[2222222][3],k;

void dfs() {
  if(dp[k][0]!=-1) return;
  rep(i,3) dp[k][i]=0;
  if(isdigit(s[k])||s[k]=='?') {
    if(isdigit(s[k])) dp[k][s[k]-'0']++;
    else rep(i,3) dp[k][i]++;
    k++;
  } else {
    ll x=k;
    k++;
    char c=s[k];
    vector<ll> v;
    k+=3;
    v.pb(k);
    dfs();
    k++;
    v.pb(k);
    dfs();
    k++;
    if(c=='a'||c=='?') {
      rep(i,3) {
        rep(j,3) {
          dp[x][max(i,j)]+=dp[v[0]][i]*dp[v[1]][j];
          dp[x][max(i,j)]%=MAX;
        }
      }
    }
    if(c=='e'||c=='?') {
      rep(i,3) {
        rep(j,3) {
          set<ll> s;
          s.in(i);
          s.in(j);
          ll y=0;
          while(s.count(y)) y++;
          dp[x][y]+=dp[v[0]][i]*dp[v[1]][j];
          dp[x][y]%=MAX;
        }
      }
    }
  }
}

void Main() {
  memset(dp,-1,sizeof(dp));
  ll x;
  cin >> s >> x;
  dfs();
  pr(dp[0][x]);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}