#include <bits/stdc++.h>
using namespace std;
long long modpow(long long b, long long e, long long mod) {
  long long ans = 1;
  for (; e; b = b * b % mod, e /= 2)
    if (e & 1) ans = ans * b % mod;
  return ans;
}
const long long mod = (119 << 23) + 1, root = 62;
void ntt(vector<long long>& a, vector<long long>& rt, vector<long long>& rev,
         int n) {
  for (int i = 0; i < (n); ++i)
    if (i < rev[i]) swap(a[i], a[rev[i]]);
  for (int k = 1; k < n; k *= 2)
    for (int i = 0; i < n; i += 2 * k)
      for (int j = 0; j < (k); ++j) {
        long long z = rt[j + k] * a[i + j + k] % mod, &ai = a[i + j];
        a[i + j + k] = (z > ai ? ai - z + mod : ai - z);
        ai += (ai + z >= mod ? z - mod : z);
      }
}
vector<long long> conv(const vector<long long>& a, const vector<long long>& b) {
  if (a.empty() || b.empty()) return {};
  int s = ((int)a.size()) + ((int)b.size()) - 1, B = 32 - __builtin_clz(s),
      n = 1 << B;
  vector<long long> L(a), R(b), out(n), rt(n, 1), rev(n);
  L.resize(n), R.resize(n);
  for (int i = 0; i < (n); ++i) rev[i] = (rev[i / 2] | (i & 1) << B) / 2;
  long long curL = mod / 2, inv = modpow(n, mod - 2, mod);
  for (int k = 2; k < n; k *= 2) {
    long long z[] = {1, modpow(root, curL /= 2, mod)};
    for (int i = k; i < (2 * k); ++i) rt[i] = rt[i / 2] * z[i & 1] % mod;
  }
  ntt(L, rt, rev, n);
  ntt(R, rt, rev, n);
  for (int i = 0; i < (n); ++i)
    out[-i & (n - 1)] = L[i] * R[i] % mod * inv % mod;
  ntt(out, rt, rev, n);
  return {out.begin(), out.begin() + s};
}
const int N = 300100;
int res[N + N];
int a[N], b[10];
vector<long long> modpoly(vector<long long> b, long long e) {
  vector<long long> ans(1, 1);
  for (; e; b = conv(b, b), e /= 2)
    if (e & 1) ans = conv(ans, b);
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= k; i++) {
    cin >> b[i];
  }
  sort(a + 1, a + 1 + n);
  sort(b + 1, b + 1 + k);
  int pt = 1;
  int t1 = 0, t2 = 0;
  vector<long long> B1(2, 0), B2(3, 0);
  B1[0] = B2[0] = 1;
  B1[1] = B2[1] = 2;
  B2[2] = 1;
  vector<long long> vec(1, 1);
  for (int i = 1; i <= k; i++) {
    while (pt <= n and a[pt] < b[i]) {
      int cnt = 0;
      int cur = a[pt];
      while (pt <= n and a[pt] == cur) pt++, cnt++;
      cnt = min(cnt, 2);
      if (cnt == 1)
        t1++;
      else
        t2++;
    }
    vec = conv(vec, conv(modpoly(B1, t1), modpoly(B2, t2)));
    for (int j = 0; j < ((int)vec.size()); j++) {
      res[b[i] + 1 + j] += vec[j];
      if (res[b[i] + 1 + j] >= mod) res[b[i] + 1 + j] -= mod;
    }
    t1 = t2 = 0;
  }
  int q;
  cin >> q;
  while (q--) {
    int Q;
    cin >> Q;
    Q /= 2;
    cout << res[Q] << "\n";
  }
}
