import sys,random

sys.setrecursionlimit(2*10**5)

def mex(i,j):
    i,j = min(i,j),max(i,j)
    if i==0:
        if j==1:
            return 2
        else:
            return 1
    else:
        return 0
        

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

mod = 998244353

S = input()
N = len(S)
K = int(input())

split_idx = [-1 for i in range(N)]

stack = []
for i in range(N):
    if S[i]=="(":
        stack.append(i)
    elif S[i]==")":
        stack.pop()
    elif S[i]==",":
        split_idx[stack[-1]] = i


def solve(l,r):
    if r-l+1==1:
        if S[l]!="?":
            res = [0 for i in range(3)]
            res[int(S[l])] = 1
            return res
        else:
            res = [1 for i in range(3)]
            return res
        
    s = split_idx[l+3]
    L0,R0 = l+4,s-1
    L1,R1 = s+1,r-1

    res0 = solve(L0,R0)
    res1 = solve(L1,R1)

    res = [0 for i in range(3)]
    for i in range(3):
        for j in range(3):
            if S[l+1]=="a":
                res[max(i,j)] += res0[i] * res1[j]
                res[max(i,j)] %= mod
            elif S[l+1]=="e":
                res[mex(i,j)] += res0[i] * res1[j]
                res[mex(i,j)] %= mod
            else:
                res[max(i,j)] += res0[i] * res1[j]
                res[max(i,j)] %= mod
                res[mex(i,j)] += res0[i] * res1[j]
                res[mex(i,j)] %= mod
    
    return res

res = solve(0,N-1)
print(res[K])