#include <iostream>
#include <vector>
using namespace std;

void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins(rest...);}
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)

constexpr int MOD = 998244353;

int N, Q;
int A[6000];
vector<vector<int>> dp;
int dfs(int i, int candidate) {
  if (N-i < candidate)
    return 0;
  if (i == N)
    return candidate == 0;
  if (dp[i][candidate] != -1)
    return dp[i][candidate];
  return (dp[i][candidate] = dfs(i+1, candidate-1) + (dfs(i+1, candidate) * (A[i]-1) % MOD)) %= MOD;
}
int main() {
  ins(N, Q);

  dp.resize(N+1);
  rep(i, N+1) {
    dp[i].resize(N-i+1, -1);
  }
  rep(i, N) {
    cin >> A[i];
  }
  rep(q, Q) {
    int B; cin >> B;
    cout << dfs(0, B) << endl;
  }

  return 0;
}