#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
from queue import PriorityQueue
import bisect
import heapq

def input():
    return sys.stdin.readline()[:-1]

sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """4 3
# 1 3 3 3
# 3 1 4
# """
# sys.stdin = io.StringIO(_INPUT)

MOD = 998244353

def main():
    N, Q = map(int, input().split())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))
    MaxA = max(A)

    dp = [[0 for _ in range(N+1)] for _ in range(N+1)]
    dp[0][0] = 1
    for i in range(N):
        for k in range(N+1):
            if dp[i][k] > 0:
                dp[i+1][k] = (dp[i+1][k] + dp[i][k] * (A[i] - 1)) % MOD
                dp[i+1][k+1] = (dp[i+1][k+1] + dp[i][k]) % MOD

    for b in B:
        print(dp[N][b])


if __name__ == '__main__':
    main()