#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;}
ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;}
ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; }
ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); }
ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); }
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/

template<class T>
vector<T> convolution_many(const vector<vector<T>> &fs)
{
  if (fs.size() == 0)
    return {1};
  deque<vector<T>> deq;
  for (auto f : fs)
    deq.push_back(f);
  while ((int)deq.size() > 1)
  {
    auto f = deq.front();
    deq.pop_front();
    auto g = deq.front();
    deq.pop_front();
    deq.push_back(convolution(f, g));
  }
  return deq.front();
}

/*
template<class T>
vector<T> convolution_many(const vector<vector<T>> &fs)
{
  if (fs.size() == 0)
    return {1};
  auto res = vector<vector<T>>(fs);
  while (res.size() > 1)
  {
    vector<vector<T>> nxt;
    for (int i = 0; i < (int)res.size(); i += 2)
    {
      if (i + 1 < (int)res.size())
        nxt.emplace_back(convolution(res[i], res[i + 1]));
      else
        nxt.emplace_back(res[i]);
    }
    res = nxt;
  }
  return res.front();
}
//*/

template<class T = mint>
vector<T> stirling1(const int N)
{
  vector<vector<T>> fs(divceil(N, 2));
  for (int i = 0; i < N; i += 2)
  {
    if (i + 1 < N)
      fs[i / 2] = {T::raw(i) * T::raw(i + 1), -2 * T::raw(i) - 1, 1};
    else
      fs[i / 2] = {-T::raw(i), 1};
  }
  return convolution_many(fs);
}

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N, Q;
  cin >> N >> Q;
  vector<ll> A(N);
  for (int i = 0; i < N; i++)
  {
    cin >> A[i];
  }

  vector<vector<mint>> fs(N);
  for (int i = 0; i < N; i++)
  {
    fs[i] = {A[i] - 1, 1};
  }
  auto g = convolution_many(fs);

  while (Q--)
  {
    int b;
    cin >> b;
    mint ans = g[b];
    cout << ans.val() << '\n';
  }
}