#include<bits/stdc++.h>
#include<random>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
//#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=1000000;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
string s;
ll k;
ll mex(ll a, ll b){
    if(a==b){
        if(a==0)return 1;
        else return 0;
    }else{
        return 3^a^b;
    }
}
vector<ll> dfs(ll &j){
    vector<ll>ans(3);
    vector<ll>l(3),r(3);
    if(s[j] == 'm'){
        ll c=s[j+1];
        j+=4;
        l=dfs(j);
        j++;
        r=dfs(j);
        if(c=='a' || c=='?'){
            rep(x,3){
                rep(y,3){
                    ans[max(x,y)]=(ans[max(x,y)]+l[x]*r[y]%mod)%mod;
                }
            }
        }
        if(c== 'e'||c=='?'){
            rep(x,3){
                rep(y,3){
                    ans[mex(x,y)]=(ans[mex(x,y)]+l[x]*r[y]%mod)%mod;
                }
            }
        }
    }else{
        if(s[j]=='?'){
            rep(x,3)ans[x]=1;
        }else{
            ans[s[j]-'0']=1;
        }
    }
    j++;
    /* 
    rep(i,3){
        cout<<ans[i]<<' ';
    }
    cout<<endl;
    */
    return ans;
}
void solve(){
    cin>>s;
    cin>>k;
    ll i=0;
    ll ans=dfs(i)[k];
    cout<<ans<<endl;
}

signed main(){
    solve();
}