#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long MOD = 998244353;
long double EPS = 1e-9;
long long binpow(long long b, long long p, long long mod) {
  long long ans = 1;
  b %= mod;
  for (; p; p >>= 1) {
    if (p & 1) ans = ans * b % mod;
    b = b * b % mod;
  }
  return ans;
}
long long fact[2000100];
long long factinv[2000100];
long long pow2[2000100];
void pre() {
  fact[0] = 1;
  for (long long i = 1; i <= 2000100 - 1; ++i) {
    fact[i] = (fact[i - 1] * i) % MOD;
  }
  pow2[0] = 1;
  for (long long i = 1; i <= 2000100 - 1; ++i) pow2[i] = pow2[i - 1] * 2 % MOD;
  factinv[0] = 1;
  factinv[1] = 1;
  for (long long i = 2; i <= 2000100 - 1; ++i) {
    factinv[i] = ((-1 * (MOD / i) * factinv[MOD % i]) % MOD + MOD) % MOD;
  }
  for (long long i = 1; i <= 2000100 - 1; ++i) {
    factinv[i] = factinv[i] * factinv[i - 1] % MOD;
  }
}
long long ncr(long long n, long long r) {
  if (r < 0 || r > n) return 0;
  return (fact[n] * (factinv[n - r] * factinv[r] % MOD)) % MOD;
}
namespace GetPrimitve {
vector<long long> Divisors;
vector<long long> Divisor(long long x) {
  vector<long long> ans;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      ans.emplace_back(i);
      while (x % i == 0) x /= i;
    }
  }
  if (x > 1) ans.emplace_back(x);
  return ans;
}
bool check(int prim, int p, vector<long long>& divs) {
  for (auto v : divs) {
    if (binpow(prim, (p - 1) / v, p) == 1) return 0;
  }
  return 1;
}
int getRoot(int p) {
  int ans = 2;
  vector<long long> divs = Divisor(p - 1);
  while (!check(ans, p, divs)) ans++;
  return ans;
}
};  // namespace GetPrimitve
namespace POLYMUL {
using polybase = long long;
const long long NTTMOD = 998244353, PRIMITIVE_ROOT = 3;
const long long MAXB = 1 << 21;
long long modInv(long long a) {
  return a <= 1
             ? a
             : (long long)(NTTMOD - NTTMOD / a) * modInv(NTTMOD % a) % NTTMOD;
}
void NTT(polybase P[], long long n, long long oper) {
  for (int i = 1, j = 0; i < n - 1; i++) {
    for (int s = n; j ^= s >>= 1, ~j & s;)
      ;
    if (i < j) swap(P[i], P[j]);
  }
  for (int d = 0; (1 << d) < n; d++) {
    int m = 1 << d, m2 = m * 2;
    long long unit_p0 = binpow(PRIMITIVE_ROOT, (NTTMOD - 1) / m2, NTTMOD);
    if (oper < 0) unit_p0 = modInv(unit_p0);
    for (int i = 0; i < n; i += m2) {
      long long unit = 1;
      for (int j = 0; j < m; j++) {
        polybase &P1 = P[i + j + m], &P2 = P[i + j];
        polybase t = unit * P1 % NTTMOD;
        P1 = (P2 - t + NTTMOD) % NTTMOD;
        P2 = (P2 + t) % NTTMOD;
        unit = unit * unit_p0 % NTTMOD;
      }
    }
  }
}
vector<polybase> mul(const vector<polybase>& a, const vector<polybase>& b) {
  vector<polybase> ret(max(0LL, (long long)a.size() + (long long)b.size() - 1),
                       0);
  static polybase A[MAXB], B[MAXB], C[MAXB];
  int len = 1;
  while (len < (long long)ret.size()) len <<= 1;
  for (int i = 0; i < len; i++) A[i] = i < (int)a.size() ? a[i] : 0;
  for (int i = 0; i < len; i++) B[i] = i < (int)b.size() ? b[i] : 0;
  NTT(A, len, 1);
  NTT(B, len, 1);
  for (long long i = 0; i < len; i++) C[i] = (polybase)A[i] * B[i] % NTTMOD;
  NTT(C, len, -1);
  for (long long i = 0, inv = modInv(len); i < (long long)ret.size(); i++)
    ret[i] = (long long)C[i] * inv % NTTMOD;
  return ret;
}
vector<long long> binpow(vector<long long> b, long long p) {
  vector<long long> ans = vector<long long>(1, 1);
  for (; p; p >>= 1) {
    if (p & 1) ans = mul(ans, b);
    b = mul(b, b);
  }
  return ans;
}
vector<long long> calc(vector<long long>& arr, int l, int r) {
  if (l == r) {
    return {};
  }
  int mid = (l + r) >> 1;
  vector<long long> x = calc(arr, l, mid), y = calc(arr, mid + 1, r);
  return mul(x, y);
}
}  // namespace POLYMUL
using namespace POLYMUL;
void solve() {
  long long n, k;
  cin >> n >> k;
  vector<long long> arr(n);
  vector<long long> brr(k);
  map<long long, long long> cnt;
  for (long long i = 0; i < (n); ++i) {
    cin >> arr[i];
    cnt[arr[i]]++;
  }
  long long dp[k][2];
  memset(dp, 0, sizeof(dp));
  for (long long i = 0; i < (k); ++i) {
    cin >> brr[i];
    for (auto v : cnt) {
      if (v.first < brr[i]) {
        if (v.second < 2) {
          dp[i][0]++;
        } else {
          dp[i][1] += 2;
        }
      }
    }
  }
  vector<long long> final[k];
  for (long long i = 0; i < (k); ++i) {
    vector<long long> poly1, poly2;
    for (long long j = 0; j <= dp[i][0]; ++j) {
      poly1.emplace_back(pow2[j] * ncr(dp[i][0], j));
    }
    for (long long j = 0; j <= dp[i][1]; ++j) {
      poly2.emplace_back(ncr(dp[i][1], j));
    }
    final[i] = mul(poly1, poly2);
  }
  int q;
  cin >> q;
  for (long long _ = 0; _ < (q); ++_) {
    long long x;
    cin >> x;
    long long ans = 0;
    for (long long i = 0; i < (k); ++i) {
      long long temp = (x - 2 * brr[i] - 2) / 2;
      if (temp >= 0 && temp < final[i].size()) {
        ans = (ans + final[i][temp]) % MOD;
      }
    }
    cout << ans << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  pre();
  long long _t = 1;
  for (long long i = 1; i <= _t; i++) {
    solve();
  }
}
