#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
const double pi = acos(-1.0);
struct complx {
  double x, y;
  complx(double a = 0, double b = 0) : x(a), y(b) {}
  complx operator+(complx c) { return complx(x + c.x, y + c.y); }
  complx operator-(complx c) { return complx(x - c.x, y - c.y); }
  complx operator*(complx c) {
    return complx(x * c.x - y * c.y, x * c.y + y * c.x);
  }
  complx operator/(double d) { return complx(x / d, y / d); }
  void operator*=(complx c) {
    double a = x * c.x - y * c.y, b = x * c.y + y * c.x;
    x = a, y = b;
  }
  void operator/=(double d) { x /= d, y /= d; }
};
vector<int> r;
void bitReverse(int n) {
  r.resize(n);
  for (int i = 0; i < n; i++) r[i] = 0;
  int p = 0;
  while ((1 << p) < n) p++;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < p; j++)
      if (i & (1 << j)) r[i] |= (1 << (p - j - 1));
  }
}
void dft(vector<complx> &a, bool inv) {
  int n = a.size();
  for (int i = 0; i < n; i++)
    if (r[i] < i) swap(a[i], a[r[i]]);
  for (int ln = 2; ln <= n; ln *= 2) {
    double ang = 2 * pi / ln * (inv ? -1 : 1);
    complx m(cos(ang), sin(ang));
    for (int i = 0; i < n; i += ln) {
      complx r(1), u, v;
      for (int j = 0; j < ln / 2; j++) {
        u = a[i + j], v = r * a[i + j + ln / 2];
        a[i + j] = u + v, a[i + j + ln / 2] = u - v;
        r *= m;
      }
    }
  }
  if (inv)
    for (auto &x : a) x /= n;
}
vector<int> multiply(vector<int> &a, vector<int> &b) {
  vector<complx> fa(a.begin(), a.end());
  vector<complx> fb(b.begin(), b.end());
  int n = 1;
  while (n < a.size() + b.size()) n *= 2;
  fa.resize(n);
  fb.resize(n);
  bitReverse(n);
  dft(fa, false);
  dft(fb, false);
  for (int i = 0; i < n; i++) fa[i] *= fb[i];
  dft(fa, true);
  vector<int> ret(n);
  for (int i = 0; i < n; i++) ret[i] = round(fa[i].x);
  return ret;
}
vector<int> v[N + 2];
void d() {
  for (int i = 2; i <= N; i += 2) {
    for (int j = i; j <= N; j += i) v[j].push_back(i);
  }
  for (int i = 1; i <= N; i++) reverse(v[i].begin(), v[i].end());
}
int ans[N + 2];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, x, y;
  cin >> n >> x >> y;
  vector<int> a(x + 1);
  for (int i = 0; i <= n; i++) {
    int v;
    cin >> v;
    a[v] = 1;
  }
  vector<int> b = a;
  reverse(b.begin(), b.end());
  vector<int> c = multiply(a, b);
  d();
  for (int i = 1; i <= N; i++) {
    for (auto z : v[i]) {
      int tr = z / 2 - y;
      if (tr <= 0) continue;
      if (tr <= x && c[x - tr]) {
        ans[i] = z;
        break;
      }
    }
    if (!ans[i]) ans[i] = -1;
  }
  int q;
  cin >> q;
  while (q--) {
    int x;
    cin >> x;
    cout << ans[x] << '\n';
  }
  return 0;
}
