n,q = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
mod = 998244353

dp = [0]*(n+1)
dp[0] = 1
for a in A:
    ndp = [0]*(n+1)
    for i in range(n+1)[::-1]:
        if dp[i] == 0:
            continue
        ndp[i+1] += dp[i]
        ndp[i+1] %= mod
        ndp[i] += dp[i]*(a-1)%mod
        ndp[i] %= mod 
    dp = ndp
for b in B:
    print(dp[b])