#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353, g = 3, ig = 332748118;
long long fpow(long long a, long long b, long long c) {
  long long ret = 1 % c;
  for (; b; b >>= 1, a = a * a % c)
    if (b & 1) ret = ret * a % c;
  return ret;
}
void ntt(vector<long long> &v, vector<int> &rev, int opt) {
  int tot = v.size();
  for (int i = 0; i < tot; i++)
    if (i < rev[i]) swap(v[i], v[rev[i]]);
  for (int mid = 1; mid < tot; mid <<= 1) {
    long long wn = fpow(opt == 1 ? g : ig, (mod - 1) / (mid << 1), mod);
    for (int j = 0; j < tot; j += mid << 1) {
      long long w = 1;
      for (int k = 0; k < mid; k++) {
        long long x = v[j + k], y = v[j + mid + k] * w % mod;
        v[j + k] = (x + y) % mod, v[j + mid + k] = (x - y + mod) % mod;
        w = w * wn % mod;
      }
    }
  }
  if (opt == -1) {
    long long itot = fpow(tot, mod - 2, mod);
    for (int i = 0; i < tot; i++) v[i] = v[i] * itot % mod;
  }
}
vector<long long> convolution(
    vector<long long> &a, int cnta, vector<long long> &b, int cntb,
    const function<long long(long long, long long)> &calc) {
  int bit = 0, tot = 1;
  while (tot < cnta + cntb) bit++, tot <<= 1;
  vector<int> rev(tot);
  for (int i = 0; i < tot; i++)
    rev[i] = rev[i >> 1] >> 1 | (i & 1) << (bit - 1);
  vector<long long> foo(tot), bar(tot);
  for (int i = 0; i < cnta; i++) foo[i] = a[i];
  for (int i = 0; i < cntb; i++) bar[i] = b[i];
  ntt(foo, rev, 1), ntt(bar, rev, 1);
  for (int i = 0; i < tot; i++) foo[i] = calc(foo[i], bar[i]);
  ntt(foo, rev, -1);
  return foo;
}
vector<long long> fac, ifac, pow2;
long long comb(long long n, long long m) {
  if (m > n) return 0;
  return fac[n] * ifac[n - m] % mod * ifac[m] % mod;
}
vector<long long> getnum(vector<int> &a, long long ub) {
  vector<long long> c(ub);
  for (auto x : a) {
    if (x < ub) {
      c[x]++;
    }
  }
  int single = 0, pairs = 0;
  for (auto x : c) {
    if (x == 1) {
      single++;
    } else if (x >= 2) {
      pairs++;
    }
  }
  vector<long long> foo(single + 1), bar(2 * pairs + 1);
  for (int i = 0; i <= single; i++) {
    foo[i] = comb(single, i) * pow2[i] % mod;
  }
  for (int i = 0; i <= pairs << 1; i++) {
    bar[i] = comb(pairs << 1, i);
  }
  return convolution(foo, single + 1, bar, pairs * 2 + 1,
                     [&](long long a, long long b) { return a * b % mod; });
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int n, m;
  cin >> n >> m;
  fac.resize(n + 1), ifac.resize(n + 1), pow2.resize(n + 1);
  fac[0] = ifac[0] = pow2[0] = 1;
  for (int i = 1; i <= n; i++) {
    fac[i] = fac[i - 1] * i % mod;
    ifac[i] = fpow(fac[i], mod - 2, mod);
    pow2[i] = pow2[i - 1] * 2 % mod;
  }
  vector<int> a(n), b(m);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> b[i];
  }
  vector<vector<long long>> res(m);
  for (int i = 0; i < m; i++) {
    res[i] = getnum(a, b[i]);
  }
  int q;
  cin >> q;
  while (q--) {
    int Q;
    cin >> Q;
    Q >>= 1;
    long long ans = 0;
    for (int i = 0; i < m; i++) {
      int cnt = Q - b[i] - 1;
      if (cnt < 0 || cnt >= res[i].size()) {
        continue;
      }
      ans = (ans + res[i][cnt]) % mod;
    }
    cout << ans << endl;
  }
  return 0;
}
