#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 998244353
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    
    ll n,q;cin>>n>>q;
    ll dp[n+1][n+1];
    rep(i,n+1)rep(j,n+1)dp[i][j]=0;
    dp[0][0]=1;
    rep(i,n){
        ll a;cin>>a;
        rep(j,n){
            dp[i+1][j]=(dp[i+1][j]+dp[i][j]*(a-1)%mod)%mod;
            dp[i+1][j+1]=(dp[i+1][j+1]+dp[i][j])%mod;
        }
    }

    while(q--){
        ll b;cin>>b;
        cout<<dp[n][b]<<endl;
    }
    return 0;
}