#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};


template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

const ll 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 { mint res(*this); return res += a; }
  mint operator-(const mint &a) const { mint res(*this); return res -= a; }
  mint operator*(const mint &a) const { mint res(*this); return res *= 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 { mint res(*this); return res /= a; }
  friend ostream &operator<<(ostream &os, const mint &m) { os << m.x; return os; }
  friend istream &operator>>(istream &is, mint &m) { is >> m.x; return is; }
};

int mex(int i, int j) {
  vector<char> c(3);
  c[i] = 1;
  c[j] = 1;
  for (int k = 0; k <= 2; ++k) if (!c[k]) return k;
  assert(0);
}

struct Node {
  Node *lhs, *rhs;
  char op;
  vector<mint> ps;
  Node() : lhs(nullptr), rhs(nullptr), op(0), ps(3, 0) {}

  void calc() {
    if (!op) return;
    lhs->calc();
    rhs->calc();

    for (char p : {'a', 'e'}) if (op == '?' || op == p) {
      for (int i : range(3))
      for (int j : range(3)) {
        int k = (p == 'a') ? max(i, j) : mex(i, j);
        ps[k] += lhs->ps[i] * rhs->ps[j];
      }
    }
  }
};

struct Parser {
  string s;
  int idx = 0;
  Node* expr() {
    dump(idx);
    int n = (int)s.size();
    if (idx >= n) return nullptr;
    Node* ret = new Node();
    if (isdigit(s[idx])) {
      ret->ps[s[idx++] - '0'] = 1;
      return ret;
    }
    if (s[idx] == '?') {
      ret->ps = vector<mint>(3, 1);
      idx++;
      return ret;
    }
    assert(s[idx++] == 'm');
    ret->op = s[idx++];
    assert(s[idx++] == 'x');
    assert(s[idx++] == '(');
    ret->lhs = expr();
    assert(s[idx++] == ',');
    ret->rhs = expr();
    assert(s[idx++] == ')');
    return ret;
  }
};

ll solve() {
  Parser parser;
  int k;
  cin >> parser.s >> k;
  Node* par = parser.expr();
  par->calc();
  return par->ps[k].x;
}

int main() {
  cout << fixed << setprecision(12);
  cout << solve() << endl;
}