import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod, comb  #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
#from functools import lru_cache, reduce
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)

sys.setrecursionlimit(6*10**4)
def mex(a,b):
    if 0 not in [a,b]:
        return 0
    elif 1 not in [a,b]:
        return 1
    else:
        return 2
    

def main():
    mod = 10**9+7
    mod2 = 998244353
    s=input()
    def solve(l,r):
        if s[l]!='m':
            if s[l]=='?':
                return [1,1,1]
            else:
                ans=[0,0,0]
                ans[int(s[l])]=1
                return ans
        else:
            count=0
            for i in range(l+4,r):
                if s[i]=='(':
                    count+=1
                elif s[i]==')':
                    count-=1
                elif s[i]==',' and count==0:
                    mid=i
                    break
            a1=solve(l+4,mid)
            a2=solve(mid+1,r)
            ans=[0,0,0]
            op={'a':[max],'e':[mex],'?':[max,mex]}
            for o in op[s[l+1]]:
                for i in range(3):
                    for j in range(3):
                        ans[o(i,j)]+=a1[i]*a2[j]
            for i in range(3):
                ans[i]%=mod2
            return ans
    print(solve(0,len(s))[int(input())])



if __name__ == '__main__':
    main()