/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 998244353;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

ll dp[2][6010] = {};
void solve(){
    ll N,Q;
    cin >> N >> Q;
    ll A[200010];
    ll B[200010];
    rep(i,0,N) cin >> A[i];
    rep(i,0,Q) cin >> B[i];
    ll cur = 0, nxt = 1;
    rep(i,0,N){
        rep(j,1,N+1){
            if(j == 1){
                dp[nxt][j] = dp[cur][j] + A[i] - 1;
                dp[nxt][j] %= MOD;

            }else{
                if(j > i+1) continue;
                dp[nxt][j] = (dp[cur][j] + dp[cur][j-1] * (A[i] - 1) % MOD) % MOD;
            }
        }
        cur ^= 1;
        nxt ^= 1;
    }
    dp[cur][0] = 1;
    // dp[0][1] = A[0]-1;
    // rep(i,1,N){
    //     dp[i][1] = dp[i-1][1] + A[i]-1;
    //     dp[i][1] %= MOD;
    // }
    // rep(i,0,N){
    //     rep(j,2,N+1){
    //         if(j > i+1) continue;
    //         dp[i][j] = (dp[i-1][j] + dp[i-1][j-1] * (A[i]-1) % MOD) % MOD;
    //     }
    // }
    // dp[N-1][0] = 1;
    rep(i,0,Q){
        print(dp[cur][N - B[i]]);
    }

    

}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}