#pragma GCC optimize("O3", "unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ld long double

constexpr ll mod = 998244353LL;

int main(void){
    int N, Q; cin >> N >> Q;
    vector<int> A(N);
    for (int i = 0; i < N; ++i)
        cin >> A[i];
    vector<vector<int>> DP(2, vector<int>(N + 1, 0));
    DP[0][0] = 1;
    for (int i = 0; i < N; ++i){
        for (int j = 0; j <= N; ++j)
            DP[(i + 1) & 1][j] = 0;
        for (int j = 0; j < N; ++j){
            DP[(i + 1) & 1][j] = (DP[(i + 1) & 1][j] + (int)(DP[i & 1][j] * (A[i] - 1LL) % mod)) % mod;
            DP[(i + 1) & 1][j + 1] = (DP[(i + 1) & 1][j + 1] + DP[i & 1][j]) % mod;
        }
    }
    while (Q--){
        int B; cin >> B;
        cout << DP[N & 1][B] << endl;
    }
    return 0;
}