MOD = 998244353

n, q = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

c = [x - 1 for x in a]

dp = [0] * (n + 2)  # dp[0..n]
dp[0] = 1
current_max_k = 0

for ci in c:
    for k in range(current_max_k, -1, -1):
        dp[k + 1] = (dp[k + 1] + dp[k]) % MOD
        dp[k] = (dp[k] * ci) % MOD
    current_max_k += 1

for bi in b:
    if 0 <= bi <= n:
        print(dp[bi] % MOD)
    else:
        print(0)