#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;

typedef long long ll;

int main() {
    ll N, Q, MOD = 998244353;
    cin >> N >> Q;
    vector<ll> A(N), B(Q);
    rep(i, N) cin >> A[i];
    rep(i, Q) cin >> B[i];
    vector<vector<ll>> ans(2, vector<ll>(N + 1, 0));
    ans[0][0] = 1;
    rep(i, N) {
        rep(j, i + 2) {
            ans[(i + 1) % 2][j] = 0;
        }
        rep(j, i + 1) {
            ans[(i + 1) % 2][j] += ans[i % 2][j];
            ans[(i + 1) % 2][j] %= MOD;
            ans[(i + 1) % 2][j + 1] += ans[i % 2][j] * (A[i] - 1);
            ans[(i + 1) % 2][j + 1] %= MOD;
        }
    }
    rep(i, Q) {
        cout << ans[N % 2][N - B[i]] << "\n";
    }
}