import sys

input = sys.stdin.buffer.readline
n, q = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
mod = 998244353
dp = [[0] * (n + 1) for _ in range(n + 1)]
dp[0][0] = 1
for i in range(n):
    ni = i + 1
    for j in range(n + 1):
        nj = j
        dp[ni][nj] += dp[i][j] * (A[i] - 1)
        dp[ni][nj] %= mod
        nj = j + 1
        if nj <= n:
            dp[ni][nj] += dp[i][j]
            dp[ni][nj] %= mod
for t in range(q):
    print(dp[n][B[t]] % mod)