#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 6666
#else
#define SIZE 6666
#endif

int N,M,Q,A[SIZE],B[SIZE];
// i番目まで見たとき,1の色の数→場合の数
int DP[2][SIZE];
int MOD=998244353;

void solve() {
    cin>>N>>Q;
    REP(i,N)cin>>A[i];
    REP(i,Q)cin>>B[i];
    DP[0][0]=A[0]-1;
    DP[0][1]=1;
    REP1(i,N-1) {
        int from = (i-1)%2, to = i%2;
        REP(j,N+1) {
            (DP[to][j+1]+=DP[from][j])%=MOD;
            (DP[to][j]+=DP[from][j]*(A[i]-1))%=MOD;
        }
        REP(j,N+1) {
            DP[from][j]=0;
        }
    }
    REP(i,Q) {
        cout << DP[(N-1)%2][B[i]] << endl;
    }
}