#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PL;
typedef pair<int,int> P;
const int INF = 1e9;
const ll MOD = 998244353;
const double eps = 1e-6;

ll modpow(ll N,ll K,ll mod = MOD) {
    ll ret = 1;
    while (K > 0) {
        if (K&1) {
            ret *= N;
            ret %= mod;
        }
        K >>= 1;
        N *= N;
        N %= mod;
    }
    return ret;
}

int main() {
    int N,Q; cin >> N >> Q;
    vector<ll> A(N);
    rep(i,N) {
        int a; cin >> a; A[i] = a - 1;
    }
    vector<int> B(Q);
    rep(i,Q) cin >> B[i];

    vector<vector<ll>> dp(N + 1,vector<ll>(N,0));
    dp[0][N - 1] = 1;
    dp[1] = A;
    rep(i,N - 1) dp[1][i + 1] = (dp[1][i + 1] + dp[1][i])%MOD;
    for (int i = 2;i < N + 1;i++){
        for (int j = 1;j < N;j++){
            dp[i][j] = (dp[i][j - 1] + dp[i - 1][j - 1] * A[j]) % MOD;
        }
    }
    rep(i,Q){
        cout << dp[N - B[i]][N - 1] << endl;
    }
}