import sys
input=sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=998244353
    N,Q=MI()
    A=LI()
    B=LI()
    
    dp=[0]*(N+1)
    # dp[i][j]はiまで見て，j個だけ色1の玉を持つ
    
    dp[0]=1
    
    for i in range(N):
        for j in range(N-1,-1,-1):
            dp[j+1]=(
                dp[j]+
                dp[j+1]*(A[i]-1)
            )%mod
        dp[0]=(dp[0] * (A[i]-1))%mod
        # print(dp)
            

            
            
    for i in range(Q):
        j=B[i]
        print(dp[j])
    


main()