#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
const double PI = acos(-1);
const int N = (1 << 21);
struct Cpx {
  double r, i;
  Cpx(double r = 0, double i = 0) : r(r), i(i) {}
  double real() const { return r; }
  void operator/=(const int c) { r /= c, i /= c; }
};
Cpx operator*(const Cpx &a, const Cpx &b) {
  return Cpx(a.r * b.r - a.i * b.i, a.r * b.i + a.i * b.r);
}
Cpx operator+(const Cpx &a, const Cpx &b) { return Cpx(a.r + b.r, a.i + b.i); }
Cpx operator-(const Cpx &a, const Cpx &b) { return Cpx(a.r - b.r, a.i - b.i); }
Cpx cp1[N + 9], cp2[N + 9];
int R[N + 9];
void fft(Cpx *a, int n, bool inv) {
  for (int i = int(0); i < int(n); ++i)
    if (R[i] < i) swap(a[R[i]], a[i]);
  for (int m = 2; m <= n; m *= 2) {
    double z = 2 * PI / m * (inv ? -1 : 1);
    Cpx wi = Cpx(cos(z), sin(z));
    for (int j = 0; j < n; j += m) {
      Cpx w(1);
      for (int k = j, k2 = j + m / 2; k2 < j + m; k++, k2++) {
        Cpx u = a[k];
        Cpx v = a[k2] * w;
        a[k] = u + v, a[k2] = u - v;
        w = w * wi;
      }
    }
  }
  if (inv)
    for (int i = int(0); i < int(n); ++i) a[i] /= n;
}
vector<long double> add(vector<long double> &p1, vector<long double> &p2) {
  int high = max(int(p1.size()), int(p2.size()));
  vector<long double> res(high, 0);
  for (int i = int(0); i < int(high); ++i) {
    if (i < int(p1.size())) res[i] += p1[i];
    if (i < int(p2.size())) res[i] += p2[i];
  }
  return res;
}
vector<long double> mul(vector<long double> &p1, vector<long double> &p2) {
  int n = int(p1.size()) + int(p2.size()) + 1;
  int m = 1, cnt = 0;
  while (m <= n) m += m, cnt++;
  for (int i = int(0); i < int(m); ++i) {
    R[i] = 0;
    for (int j = int(0); j < int(cnt); ++j) R[i] = (R[i] << 1) | ((i >> j) & 1);
  }
  for (int i = int(0); i < int(m); ++i) cp1[i] = 0, cp2[i] = 0;
  for (int i = int(0); i < int(int(p1.size())); ++i) cp1[i] = p1[i];
  for (int i = int(0); i < int(int(p2.size())); ++i) cp2[i] = p2[i];
  fft(cp1, m, false);
  fft(cp2, m, false);
  for (int i = int(0); i < int(m); ++i) cp1[i] = cp1[i] * cp2[i];
  fft(cp1, m, true);
  vector<long double> res;
  n -= 2;
  for (int i = int(0); i < int(n); ++i) {
    res.push_back((long long)floor(cp1[i].real() + 0.5));
  }
  return res;
}
const int off = 2e5;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, x, y;
  cin >> n >> x >> y;
  vector<long double> f(2 * off + 1, 0), g(2 * off + 1, 0);
  for (int i = int(0); i < int(n + 1); ++i) {
    int a;
    cin >> a;
    f[off + a]++;
    g[off - a]++;
  }
  f = mul(f, g);
  int q;
  cin >> q;
  set<int, greater<int> > s;
  while (q--) {
    s.clear();
    int num;
    cin >> num;
    for (int d = 1; d * d <= num; ++d) {
      if (num % d == 0) {
        int p = d, q = num / d;
        s.insert(p);
        if (p != q) s.insert(q);
      }
    }
    int ans = -1;
    for (auto u : s) {
      u -= 2 * y;
      if (u <= 0 or u % 2) continue;
      u /= 2;
      if (f[2 * off + u]) {
        ans = 2 * (u + y);
        break;
      }
    }
    cout << ans << " ";
  }
  cout << endl;
  return 0;
}
