#include <bits/stdc++.h>
using namespace std;
int fpow(int a, int k, int p) {
  if (!k) return 1;
  int res = a, tmp = a;
  k--;
  while (k) {
    if (k & 1) {
      res = (long long)res * tmp % p;
    }
    tmp = (long long)tmp * tmp % p;
    k >>= 1;
  }
  return res;
}
struct NTT {
  static const int MAXF = 1 << 20;
  int pr;
  int rts[MAXF + 1];
  int bitrev[MAXF];
  void init(int pr, int pw) {
    this->pr = pr;
    int k = 0;
    while ((1 << k) < MAXF) k++;
    bitrev[0] = 0;
    for (int i = 1; i < MAXF; i++) {
      bitrev[i] = bitrev[i >> 1] >> 1 | ((i & 1) << k - 1);
    }
    pw = fpow(pw, (pr - 1) / MAXF, pr);
    rts[0] = 1;
    for (int i = 1; i <= MAXF; i++) {
      rts[i] = (long long)rts[i - 1] * pw % pr;
    }
  }
  void dft(int a[], int n, int sign) {
    int d = 0;
    while ((1 << d) * n != MAXF) d++;
    for (int i = 0; i < n; i++) {
      if (i < (bitrev[i] >> d)) {
        swap(a[i], a[bitrev[i] >> d]);
      }
    }
    for (int len = 2; len <= n; len <<= 1) {
      int delta = MAXF / len * sign;
      for (int i = 0; i < n; i += len) {
        int *x = a + i, *y = a + i + (len >> 1),
            *w = sign > 0 ? rts : rts + MAXF;
        for (int k = 0; k + k < len; k++) {
          int z = (long long)*y * *w % pr;
          *y = *x - z, *x = *x + z;
          if (*y < 0) *y += pr;
          if (*x >= pr) *x -= pr;
          x++, y++, w += delta;
        }
      }
    }
    if (sign < 0) {
      int in = fpow(n, pr - 2, pr);
      for (int i = 0; i < n; i++) {
        a[i] = (long long)a[i] * in % pr;
      }
    }
  }
  void multiply(vector<int> &a, vector<int> &b, int na, int nb, int c[]) {
    static int fa[MAXF], fb[MAXF];
    int n = na + nb - 1;
    while (n != (n & -n)) n += n & -n;
    for (int i = 0; i < n; i++) fa[i] = fb[i] = 0;
    for (int i = 0; i < na; i++) fa[i] = a[i];
    for (int i = 0; i < nb; i++) fb[i] = b[i];
    dft(fa, n, 1), dft(fb, n, 1);
    for (int i = 0; i < n; i++) fa[i] = (long long)fa[i] * fb[i] % pr;
    dft(fa, n, -1);
    for (int i = 0; i < n; i++) c[i] = fa[i];
  }
  vector<int> multiply(vector<int> &a, vector<int> &b) {
    static int fc[MAXF];
    int na = a.size(), nb = b.size();
    multiply(a, b, na, nb, fc);
    int k = na + nb - 1;
    vector<int> res(k);
    for (int i = 0; i < k; i++) res[i] = fc[i];
    return res;
  }
} ntt;
const int mod = 998244353, N = 3e5 + 5;
int a[N], fr[N];
int pw[N], fac[N], inv[N];
void init() {
  ntt.init(mod, 3);
  pw[0] = 1, fac[0] = 1, inv[0] = 1;
  for (int i = 1; i < N; i++) {
    pw[i] = (pw[i - 1] + pw[i - 1]) % mod;
    fac[i] = (fac[i - 1] * 1ll * i) % mod;
    inv[i] = fpow(fac[i], mod - 2, mod);
  }
}
int ncr(int n, int r) {
  return (fac[n] * 1ll * inv[r]) % mod * 1ll * inv[n - r] % mod;
}
vector<int> ps[6];
int b[6];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  init();
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    fr[a[i]]++;
  }
  for (int i = 0; i < k; i++) {
    cin >> b[i];
    int sz1 = 0, sz2 = 0;
    for (int j = 1; j < b[i]; j++) {
      if (fr[j] == 1)
        sz1++;
      else if (fr[j] > 1)
        sz2++;
    }
    vector<int> a1(sz1 + 1);
    for (int i = 0; i <= sz1; i++) {
      a1[i] = (ncr(sz1, i) * 1ll * pw[i]) % mod;
    }
    sz2 <<= 1;
    vector<int> b1(sz2 + 1);
    for (int i = 0; i <= sz2; i++) {
      b1[i] = ncr(sz2, i);
    }
    ps[i] = ntt.multiply(a1, b1);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int pr;
    cin >> pr;
    int ans = 0;
    for (int j = 0; j < k; j++) {
      int x = pr - 2 * b[j] - 2;
      if (x < 0) continue;
      x >>= 1;
      if (x < ps[j].size()) ans = (ans + ps[j][x]) % mod;
    }
    cout << ans << '\n';
  }
  return 0;
}
