"""
ref
https://atcoder.jp/contests/typical90/submissions/29013313
"""
MOD = 998244353
RT = 3


def pr(n):
    return pow(RT, (MOD-1) // n, MOD)


def inv(x):
    return pow(x, MOD-2, MOD)


def FFT(a, w):
    N = len(a)
    if N == 1:
        return a
    even = a[::2]
    odd = a[1::2]
    ww = w * w % MOD
    EVEN = FFT(even, (ww) % MOD)
    ODD = FFT(odd, (ww) % MOD)

    A = [0] * N
    wk = 1
    for k in range(N):
        A[k] = (EVEN[k % (N//2)] + wk * ODD[k % (N//2)] % MOD) % MOD
        wk = wk * w % MOD
    return A


def convolution(a, b):
    d = len(a) + len(b) - 1
    n = 1
    while (1 << n) < d:
        n += 1
    N = 1 << n
    w = pr(N)
    a += [0] * (N - len(a))
    b += [0] * (N - len(b))
    A = FFT(a, w)
    B = FFT(b, w)
    C = [A[i] * B[i] % MOD for i in range(N)]

    winv = inv(w)
    c = FFT(C, winv)
    invN = inv(N)
    for i in range(N):
        c[i] = c[i] * invN % MOD
    return c[:d]


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

    que = [[a-1, 1] for a in A]
    while len(que) > 1:
        nque = []
        while len(que) > 1:
            nque.append(convolution(que.pop(), que.pop()))
        if que:
            nque.append(que.pop())
        que = nque

    F = que.pop()
    for b in B:
        print(F[b])


main()