#include <algorithm>
#include <iostream>
#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;

int64_t pow(int64_t a, int64_t b) {
  int64_t x = 1, step = 1 << 30;
  while (step > 0) {
    x = x * x % MOD;
    if (step & b) x = x * a % MOD;
    step >>= 1;
  }
  return x;
}

void fft(vector<int64_t>& a) {
  int n = a.size();
  for (int i = 0; i < n; i++) {
    int j = 0;
    int x = i, y = n - 1;
    while (y > 0) {
      j = (j << 1) + (x & 1);
      x >>= 1;
      y >>= 1;
    }
    if (i < j) swap(a[i], a[j]);
  }
  for (int len = 1; len < n; len *= 2) {
    int64_t root = pow(5, (MOD - 1) / (2 * len));
    for (int i = 0; i < n; i += 2 * len) {
      int64_t w = 1;
      for (int j = 0; j < len; j++) {
        int64_t u = a[i + j];
        int64_t v = a[i + j + len] * w % MOD;
        a[i + j] = (u + v) % MOD;
        a[i + j + len] = (MOD + u - v) % MOD;
        w = w * root % MOD;
      }
    }
  }
}

vector<int64_t> multiply(vector<int64_t> a, vector<int64_t> b) {
  int an = a.size();
  int bn = b.size();
  int need = an + bn - 1;
  int nn = 1;
  while (nn < 2 * an || nn < 2 * bn) nn <<= 1;
  a.resize(nn);
  b.resize(nn);
  fft(a);
  fft(b);
  for (int i = 0; i < nn; i++) a[i] = a[i] * b[i] % MOD;
  reverse(++a.begin(), a.end());
  fft(a);
  int64_t inv = pow(nn, MOD - 2);
  for (int i = 0; i < nn; i++) a[i] = a[i] * inv % MOD;
  a.resize(need);
  return a;
}

vector<ll> solve(vector<ll> a) {
  int n = a.size();
  if (n == 1) return {1, a[0] - 1};

  vector<ll> b(a.begin(), a.begin() + n / 2);
  vector<ll> c(a.begin() + n / 2, a.end());
  return multiply(solve(b), solve(c));
}

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

  vector<ll> c = solve(a);

  reverse(c.begin(), c.end());
  rep(i, 0, q) {
    cin >> b;
    cout << c[b] << '\n';
  }
  return 0;
}