#include <bits/stdc++.h>
#define REP(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
template<class T, class U> inline bool chmax(T &a, const U &b) { if(a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if(a > b) { a = b; return true; } return false; }

ll MOD = 998244353;
int n, q, a[200000];
ll dp[6010][6010];

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  cin >> n >> q;
  rep(i, n) cin >> a[i];
  dp[0][0] = 1;
  rep(i, n) {
    rep(j, n+1) {
      dp[i+1][j] += dp[i][j]*(a[i]-1);
      dp[i+1][j] %= MOD;
      dp[i+1][j+1] += dp[i][j];
      dp[i+1][j+1] %= MOD;
    }
  }
  rep(qi, q) {
    int b;
    cin >> b;
    cout << dp[n][b] << '\n';
  }
  return 0;
}