#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> P) {
  out << '(' << P.first << ',' << P.second << ')';
  return out;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T> V) {
  for (int i = 0; i < ((int)((int)V.size())); i++)
    out << V[i] << ((i != ((int)V.size()) - 1) ? " " : "");
  return out;
}
const long long maxn = 1 << 19;
const long long maxlg = 20;
const long long INF64 = 1e18;
const int INF = 0x3f3f3f3f;
const long long MOD = 998244353;
const long double PI = acos(-1);
const long double eps = 1e-9;
const long long g = 3;
long long mypow(long long a, long long b) {
  long long res = 1LL;
  while (b) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return res;
}
long long INV(long long a) { return mypow(a, MOD - 2); }
long long e[maxn + 3];
void NTT(vector<long long>& a, bool inv) {
  int i = 0;
  for (int j = 1; j < maxn - 1; j++) {
    for (int k = maxn >> 1; k > (i ^= k); k >>= 1)
      ;
    if (j < i) swap(a[i], a[j]);
  }
  for (int step = 1; step + step <= maxn; step <<= 1) {
    long long meow = e[step];
    if (inv) meow = INV(meow);
    for (int i = 0; i < maxn; i += step + step) {
      long long tmp = 1;
      for (int j = 0; j < step; j++) {
        long long u = a[i + j];
        long long v = a[i + step + j];
        v = v * tmp % MOD;
        a[i + j] = (u + v) % MOD;
        a[i + step + j] = (u - v + MOD) % MOD;
        tmp = tmp * meow % MOD;
      }
    }
  }
  if (inv)
    for (i = 0; i < maxn; i++) a[i] = a[i] * INV(maxn) % MOD;
}
vector<long long> A, B;
long long ans[maxn + maxn];
void cal(vector<int>& v) {
  int cnt1 = 0, cnt2 = 0;
  for (int i = 0; i < ((int)((int)v.size())); i++) {
    if (v[i] >= 2)
      cnt2++;
    else
      cnt1++;
  }
  {
    A.clear();
    long long ex = 1;
    long long C = 1;
    for (int i = 0; i < ((int)cnt1 + 1); i++) {
      A.push_back(C * ex % MOD);
      ex = ex << 1;
      if (ex >= MOD) ex -= MOD;
      C = C * (cnt1 - i) % MOD * INV(i + 1) % MOD;
    }
  }
  {
    B.clear();
    long long C = 1;
    for (int i = 0; i < ((int)2 * cnt2 + 1); i++) {
      B.push_back(C % MOD);
      C = C * (2 * cnt2 - i) % MOD * INV(i + 1) % MOD;
    }
  }
  while (((int)A.size()) < maxn) A.push_back(0);
  while (((int)B.size()) < maxn) B.push_back(0);
  NTT(A, 0);
  NTT(B, 0);
  for (int i = 0; i < ((int)maxn); i++) A[i] = A[i] * B[i] % MOD;
  NTT(A, 1);
}
map<int, int> mp;
int a[maxn];
int b[maxn];
int Q[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  for (int i = 0; i < ((int)19); i++) {
    e[1 << i] = mypow(g, (MOD - 1) / (1 << (i + 1)));
  }
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < ((int)n); i++) cin >> a[i];
  for (int i = 0; i < ((int)n); i++) mp[a[i]]++;
  for (int i = 0; i < ((int)k); i++) cin >> b[i];
  for (int i = 0; i < ((int)k); i++) {
    vector<int> v;
    for (auto j : mp)
      if (j.first < b[i]) {
        v.push_back(j.second);
      }
    cal(v);
    for (int j = 0; j < ((int)maxn); j++) {
      ans[b[i] + j] += A[j];
      if (ans[b[i] + j] >= MOD) ans[b[i] + j] -= MOD;
    }
  }
  int q;
  cin >> q;
  while (q--) {
    long long meow;
    cin >> meow;
    meow /= 2;
    cout << ans[meow - 1] << '\n';
  }
  return 0;
}
