#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
ll mod=998244353;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

using podata=vector<ll>;

vector<vector<int>> mex={{1,2,1},{2,0,0},{1,0,0}};

podata max_data(podata a,podata b){
	podata c(3);
	rep(i,3) rep(j,3){
		c[max(i,j)]+=(a[i]*b[j])%mod;
	}
	rep(i,3) c[i]%=mod;
	return c;
}

podata mex_data(podata a,podata b){
	podata c(3);
	rep(i,3) rep(j,3){
		c[mex[i][j]]+=(a[i]*b[j])%mod;
	}
	rep(i,3) c[i]%=mod;
	return c;
}

podata mix(podata a,podata b){
	podata c=max_data(a,b);
	podata d=mex_data(a,b);
	rep(i,3) c[i]=(c[i]+d[i])%mod;
	return c;
}

ll solve(string &S,int k){
	stack<podata> s;
	reverse(S.begin(),S.end());
	rep(i,S.size()){
		if(S[i]==')'||S[i]=='('||S[i]==',') continue;
		if(S[i]=='x'){
			podata a=s.top();
			s.pop();
			podata b=s.top();
			s.pop();
			i++;
			if(S[i]=='e') s.push(mex_data(a,b));
			else if(S[i]=='a') s.push(max_data(a,b));
			else s.push(mix(a,b));
			i++;
		}
		else{
			int a=-1;
			podata D(3);
			if(S[i]!='?'){
				a=S[i]-'0';
				D[a]=1;
			}
			else{
				rep(j,3) D[j]=1;
			}
			/*rep(j,3) cout<<D[j]<<" ";
			cout<<i<<endl;*/
			s.push(D);
		}
	}
	//cout<<s.top()[0]<<" "<<s.top()[1]<<" "<<s.top()[2]<<endl;
	return s.top()[k];

}

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	string S;
	int k;
	cin>>S>>k;
	cout<<(mod+solve(S,k)%mod)%mod<<"\n";
}