#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
using vc = pair<ll,vector<ll>>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 998244353;

int main(){
    int n,q;
    cin >> n >> q;
    vector<ll> a(n),b(q);
    rep(i,n) cin >> a[i];
    rep(i,q) cin >> b[i];
    vector<vector<ll>> dp(n+1,vector<ll>(n+1,0));
    dp[0][0] = 1;
    for(int i=1;i<=n;i++){
        rep(j,n+1){
            if(j > 0) dp[i][j] = ((dp[i-1][j]*(a[i-1]-1))%MOD + dp[i-1][j-1])%MOD;
            else dp[i][j] = (dp[i-1][j]*(a[i-1]-1))%MOD;
        }
    }
    rep(i,q){
        cout << dp[n][b[i]] << '\n' ;
    }
    return 0;
}