#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int INF = 2e9;
constexpr ll mod = 998244353;
int main() {
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  rep(i,n) cin >> a[i];

  vector<vector<ll>> dp(2, vector<ll>(n + 1, 0));

  dp[0][0] = 1;

  for (int i = 0; i < n; i++) {
    dp[(i + 1) & 1] = vector<ll>(n + 1, 0);
    for (int j = 0; j <= n; j++) {
      (dp[(i + 1) & 1][j] += (dp[i & 1][j] * (a[i] - 1)) % mod) %= mod;
      if (j < n) (dp[(i + 1) & 1][j + 1] += dp[i & 1][j] ) %= mod;
    }
  }

  while (q--) {
    int b;
    cin >> b;
    cout << dp[n & 1][b] << endl;
  }
  return 0;
}