#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
using namespace std;

int main()
{   
    int N, Q; cin >> N >> Q;
    long A[7000];
    REP(i, N) cin >> A[i];
    long B[7000];
    REP(i, Q) cin >> B[i];
    long mod = 998244353;

    long dp1[7000], dp2[7000];
    REP(i, N+1) dp1[i] = 0l;
    dp1[0] = A[0]-1l;
    dp1[1] = 1l;
    REP(i, N-1){
        REP(j, N+1) dp2[j] = 0l;
        REP(j, N+1){
            dp2[j] += (dp1[j] * (A[i+1] - 1l)) % mod;
            dp2[j] %= mod;
        }
        REP(j, N){
            dp2[j+1] += dp1[j]; 
            dp2[j+1] %= mod;
        }
        REP(j, N+1) dp1[j] = dp2[j];
    }
    REP(i, Q) cout << dp1[B[i]] << endl;

    return 0;
}