#include <bits/stdc++.h>

#include <atcoder/modint>

#include <algorithm>
#include <cassert>
#include <vector>

template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}

template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

template <typename T>
struct CoordComp {
    std::vector<T> v;
    bool sorted;

    CoordComp() : sorted(false) {}

    int size() { return v.size(); }

    void add(T x) { v.push_back(x); }

    void build() {
        std::sort(v.begin(), v.end());

        v.erase(std::unique(v.begin(), v.end()), v.end());
        sorted = true;
    }

    int get_idx(T x) {
        assert(sorted);
        return lower_bound(v.begin(), v.end(), x) - v.begin();
    }

    T &operator[](int i) { return v[i]; }
};


#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For(i, 0, n)
#define rrep(i, n) rFor(i, n, 0)
#define fi first
#define se second

using namespace std;

using lint = long long;
using pii = pair<int, int>;
using pll = pair<lint, lint>;

using namespace atcoder;
using mint = modint998244353;

int mex(int x, int y) {
    if (x > y) swap(x, y);
    if (x >= 1) return 0;
    if (x == 0 && y == 1) return 2;
    return 1;
}

array<mint, 3> expr(string &s, int &i) {
    array<mint, 3> res;
    fill(res.begin(), res.end(), 0);
    if (s[i] == 'm') {
        if (s[i + 1] == 'a') {
            i += 4;
            auto a = expr(s, i);
            ++i;
            auto b = expr(s, i);
            ++i;
            rep(x, 3) rep(y, 3) res[max(x, y)] += a[x] * b[y];
        } else if (s[i + 1] == 'e') {
            i += 4;
            auto a = expr(s, i);
            ++i;
            auto b = expr(s, i);
            ++i;
            rep(x, 3) rep(y, 3) res[mex(x, y)] += a[x] * b[y];
        } else {
            i += 4;
            auto a = expr(s, i);
            ++i;
            auto b = expr(s, i);
            ++i;
            rep(x, 3) rep(y, 3) res[max(x, y)] += a[x] * b[y];
            rep(x, 3) rep(y, 3) res[mex(x, y)] += a[x] * b[y];
        }
    } else if (s[i] == '?') {
        fill(res.begin(), res.end(), 1);
        ++i;
    } else {
        res[s[i] - '0'] = 1;
        ++i;
    }
    return res;
}

int main() {
    string s;
    int K;
    cin >> s >> K;
    int idx = 0;
    auto ans = expr(s, idx);
    printf("%u\n", ans[K].val());
}