#include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)

constexpr ll MOD = 998244353;

ll dp[6060][6060];

int main() {
  int n, q, b;
  cin >> n >> q;
  vector<ll> a(n);
  rep(i, 0, n) cin >> a[i];

  dp[0][0] = 1;
  rep(i, 0, n) {
    rep(j, 0, n) {
      dp[i + 1][j + 1] += dp[i][j];
      (dp[i + 1][j] += dp[i][j] * (a[i] - 1)) %= MOD;
    }
  }

  rep(i, 0, q) {
    cin >> b;
    cout << dp[n][b] << '\n';
  }
  return 0;
}