import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.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 BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# 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)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

n, q = LI()
aa = LI()
bb=LI()

dp=[[0]*(n+1) for _ in range(n+1)]
dp[0][0]=1

for i,a in enumerate(aa):
    for j in range(i+1):
        pre=dp[i][j]
        if pre==0:continue
        dp[i+1][j]=(dp[i+1][j]+pre*(a-1))%md
        dp[i+1][j+1]=(dp[i+1][j+1]+pre)%md

for b in bb:print(dp[n][b])