"""

構文解析だな
カンマを見付けるのがむずい

まず、
m?x( , )
の、mと,を対応付ける前処理をする。

mが来たらpush
,が来たらstackに入れる

"""

import sys
from sys import stdin
import heapq
sys.setrecursionlimit(200000)

mod = 998244353

def solve(l,r):

    # (l,r)
    #print (type(l))

    if S[l] == "0":
        return (1,0,0)
    elif S[l] == "1":
        return (0,1,0)
    elif S[l] == "2":
        return (0,0,1)
    elif S[l] == "?":
        return (1,1,1)
    else:

        #まず、カンマを見付ける

        ltup = solve(l+4,MtoC[l])
        rtup = solve(MtoC[l]+1 , r-1)

        ans = [0,0,0]

        if S[l+1] == "a" or S[l+1] == "?":
            for li in range(3):
                for ri in range(3):
                    ans[max(li,ri)] += ltup[li] * rtup[ri]

        if S[l+1] == "e" or S[l+1] == "?":
            for li in range(3):
                for ri in range(3):

                    if li*ri == 0: #0がある
                        if li+ri == 1:
                            mex = 2
                        else:
                            mex = 1
                    else:
                        mex = 0
                        
                        
                    ans[mex] += ltup[li] * rtup[ri]
        for i in range(3):
            ans[i] %= mod

        return ans
        
    

S = stdin.readline()[:-1]
K = int(stdin.readline())

stk = []
MtoC = {}
for i in range(len(S)):
    if S[i] == "m":
        stk.append(i)
    elif S[i] == ",":
        MtoC[stk[-1]] = i
        del stk[-1]

#print (MtoC)

ans = solve(0,len(S))

print (ans[K])