#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll mod=998244353;

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