#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
//const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in: v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e: t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  string S;
  int K;
  cin >> S >> K;
  int N = (int) S.size();

  int k = 0;
  auto recog = MFP([&](auto recog) -> array< int, 3 > {
    if(S[k] == 'm') {
      ++k;
      char t = S[k];
      ++k; // x
      ++k; // (
      ++k;
      auto l = recog();
      ++k; // ,
      auto r = recog();
      ++k; // )
      array< int, 3 > v{0, 0, 0};
      if(t == 'e' or t == '?') {
        for(int i = 0; i < 3; i++) {
          for(int j = 0; j < 3; j++) {
            int p = 0;
            while(p == i or p == j) ++p;
            v[p] += 1LL * l[i] * r[j] % mod;
            if(v[p] >= mod) v[p] -= mod;
          }
        }
      }
      if(t == 'a' or t == '?') {
        for(int i = 0; i < 3; i++) {
          for(int j = 0; j < 3; j++) {
            int p = max(i, j);
            v[p] += 1LL * l[i] * r[j] % mod;
            if(v[p] >= mod) v[p] -= mod;
          }
        }
      }
      return v;
    } else if(S[k] == '0') {
      ++k;
      return {1, 0, 0};
    } else if(S[k] == '1') {
      ++k;
      return {0, 1, 0};
    } else if(S[k] == '2') {
      ++k;
      return {0, 0, 1};
    } else {
      ++k;
      return {1, 1, 1};
    }
  });
  cout << recog()[K] << "\n";
}