#include <bits/stdc++.h>
using namespace std;
#define INF_LL 100000000000000000LL
#define INF 200000000
#define MOD 998244353
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
// typedef float double;
// typedef priority_queue prique;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<ll> vl;
typedef vector<vi> matrix;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int sign[2] = {1, -1};
template <class T> bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}

ll modpow(ll a, ll b, ll m) {
    if(b == 0)
        return 1;
    ll t = modpow(a, b / 2, m);
    if(b & 1) {
        return (t * t % m) * a % m;
    } else {
        return t * t % m;
    }
}

struct edge {
    int to;
    ll cost;
    edge(int t, ll c) { to = t, cost = c; }
};

ll dp[2][6001];

signed main() {
    int n, q;
    cin >> n >> q;
    vl a(n);
    rep(i, n) cin >> a[i];
    dp[0][0] = 1;
    rep(i, n) {
        if(i % 2 == 0) {
            memset(dp[1], 0, sizeof(dp[1]));
            rep(j, n) {
                dp[1][j + 1] += dp[0][j];
                dp[1][j] += (ll)dp[0][j] * (a[i] - 1);
                dp[1][j + 1] %= MOD;
                dp[1][j] %= MOD;
            }
        } else {
            memset(dp[0], 0, sizeof(dp[0]));
            rep(j, n) {
                dp[0][j + 1] += dp[1][j];
                dp[0][j] += (ll)dp[1][j] * (a[i] - 1);
                dp[0][j + 1] %= MOD;
                dp[0][j] %= MOD;
            }
        }
    }
    rep(i, q) {
        int b;
        cin >> b;
        cout << dp[n % 2][b] << endl;
    }
    return 0;
}