mod = 998244353
n,q = map(int,input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]

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

for i in range(n):
    ndp = [0]*(n+1)
    for j in range(n+1):
        if j >= 1:
            ndp[j] = dp[j]*(a[i]-1)%mod + dp[j-1]%mod
        else:
            ndp[j] = dp[j]*(a[i]-1)%mod
        ndp[j] %= mod
    dp = ndp[:]

for i in range(q):
    print(dp[b[i]])