/* -*- coding: utf-8 -*-
 *
 * 1677.cc:  No.1677 mæx - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MOD = 998244353;

const int fmex[3][3] = {
  { 1, 2, 1 },
  { 2, 0, 0 },
  { 1, 0, 0 }
};

enum { MAX, MEX, MAEX };

/* typedef */

typedef long long ll;

template<const int MOD>
struct MI {
  int v;
  MI(): v() {}
  MI(int _v): v(_v) {}

  MI operator+(const MI m) const { return MI((v + m.v) % MOD); }
  MI operator-(const MI m) const { return MI((v + MOD - m.v) % MOD); }
  MI operator*(const MI m) const { return MI((ll)v * m.v % MOD); }

  MI &operator+=(const MI m) { return (*this = *this + m); }
  MI &operator-=(const MI m) { return (*this = *this - m); }
  MI &operator*=(const MI m) { return (*this = *this * m); }
};

typedef MI<MOD> mi;

struct Val {
  mi ds[3];
  Val(): ds() {}

  Val &setc(char c) { // c = '0', '1', '2', '?'
    memset(ds, 0, sizeof(ds));
    if (c == '?') ds[0] = ds[1] = ds[2] = 1;
    else ds[c - '0'] = 1;
    return *this;
  }
  
  Val &setmax(Val va, Val vb) {
    memset(ds, 0, sizeof(ds));
    for (int i = 0; i < 3; i++)
      for (int j = 0; j < 3; j++)
	ds[max(i, j)] += va.ds[i] * vb.ds[j];
    return *this;
  }

  Val &setmex(Val va, Val vb) {
    memset(ds, 0, sizeof(ds));
    for (int i = 0; i < 3; i++)
      for (int j = 0; j < 3; j++)
	ds[fmex[i][j]] += va.ds[i] * vb.ds[j];
    return *this;
  }

  Val operator+(const Val &v) const {
    Val r;
    for (int i = 0; i < 3; i++) r.ds[i] = ds[i] + v.ds[i];
    return r;
  }
};

/* global variables */

char s[MAX_N + 4];
int ps[MAX_N], cs[MAX_N][2], cis[MAX_N], ts[MAX_N];
Val vs[MAX_N];

/* subroutines */

/* main */

int main() {
  int k;
  scanf("%s%d", s, &k);

  char *cpt = s;
  ps[0] = -1;

  for (int u = 0, x = 1; u >= 0;) {
    int up = ps[u];

    if (cis[u] == 0) {
      if (*cpt != 'm') {
	vs[u].setc(*(cpt++));
	u = up;
      }
      else {
	cpt++; // 'm'
	char op = *(cpt++); // 'a' or 'e', or '?'
	cpt++, cpt++; // 'x('

	ts[u] = (op == 'a') ? MAX : (op == 'e') ? MEX : MAEX;

	cis[u]++;
	int v = cs[u][0] = x++;
	ps[v] = u;
	u = v;
      }
    }
    else if (cis[u] == 1) {
      cpt++; // ','

      cis[u]++;
      int v = cs[u][1] = x++;
      ps[v] = u;
      u = v;
    }
    else {
      cpt++; // ')'

      Val &va = vs[cs[u][0]], &vb = vs[cs[u][1]];
      switch (ts[u]) {
      case MAX: vs[u].setmax(va, vb); break;
      case MEX: vs[u].setmex(va, vb); break;
      default: // MAEX
	Val vmax, vmex;
	vmax.setmax(va, vb);
	vmex.setmex(va, vb);
	vs[u] = vmax + vmex;
      }

      u = up;
    }
  }

  printf("%d\n", vs[0].ds[k].v);
  return 0;
}