#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
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) {return (A % M + M) % M;}
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);}
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(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(vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

#include <atcoder/convolution>

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

  vector<vector<mint>> F(N);
  for (ll i = 0; i < N; i++)
  {
    F.at(i) = {A.at(i) - 1, 1};
  }

  while (F.size() > 1)
  {
    auto F0 = F;
    vector<vector<mint>> F1;
    for (ll i = 0; i < (ll)F.size(); i += 2)
    {
      auto f = F.at(i), g = (i + 1 < (ll)F.size() ? F.at(i + 1) : vector<mint>(1, 1));
      auto h = convolution(f, g);
      F1.push_back(h);
    }
    F = F1;
  }

  auto G = F.front();
  for (ll q = 0; q < Q; q++)
  {
    ll b;
    cin >> b;

    mint ans = G.at(b);
    cout << ans.val() << '\n';
  }
}