#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;

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

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