import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**20 md = 998244353 # md = 10**9+7 from functools import lru_cache from collections import defaultdict @lru_cache(None) def mex(a,b): for i in range(3): if i!=a and i!=b: return i @lru_cache(None) def solve(l,r,k): if r-l==1: return s[l]=="?" or int(s[l])==k m=mm[l] res=0 if s[l+1]!="e": for a in range(3): for b in range(3): if max(a,b)!=k:continue res+=solve(l+4,m,a)*solve(m+1,r-1,b)%md res%=md if s[l+1]!="a": for a in range(3): for b in range(3): if mex(a,b)!=k:continue res+=solve(l+4,m,a)*solve(m+1,r-1,b)%md res%=md return res s=SI() k=II() n=len(s) mm=[-1]*n d=0 dtol=defaultdict(int) for i,c in enumerate(s): if c=="m": dtol[d]=i d+=1 if c==")": d-=1 if c==",": mm[dtol[d-1]]=i print(solve(0,n,k))