#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
  in >> a.first >> a.second;
  return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
  out << a.first << " " << a.second;
  return out;
}
template <typename T, typename T1>
T maxs(T& a, T1 b) {
  if (b > a) a = b;
  return a;
}
template <typename T, typename T1>
T mins(T& a, T1 b) {
  if (b < a) a = b;
  return a;
}
const int s = 3e5;
const int maxn = 2e6 + 5;
int ans[maxn];
const double pi = 3.141592653589793238;
void fft(vector<complex<double> >& a, bool direction) {
  if ((int)a.size() == 1) return;
  int n = (int)a.size();
  for (int i = 1, j = 0; i < n; i++) {
    int bit = n >> 1;
    for (; j >= bit; bit >>= 1) j -= bit;
    j += bit;
    if (i < j) swap(a[i], a[j]);
  }
  for (int d = 2; d <= n; d <<= 1) {
    double ang = 2 * pi / d * (direction ? -1 : 1);
    complex<double> wd(cos(ang), sin(ang));
    for (int i = 0; i < n; i += d) {
      complex<double> w(1);
      for (int j = 0; j < d / 2; ++j) {
        complex<double> u = a[i + j], v = a[i + j + d / 2] * w;
        a[i + j] = u + v;
        a[i + j + d / 2] = u - v;
        w *= wd;
      }
    }
  }
  if (direction) {
    for (int i = 0; i < n; ++i) a[i] /= n;
  }
}
void multiply(vector<int>& a, vector<int>& b, vector<int>& c) {
  vector<complex<double> > A(a.begin(), a.end()), B(b.begin(), b.end());
  int n = 1;
  while (n < max((int)a.size(), (int)b.size())) n = n << 1;
  n = n << 1;
  A.resize(n), B.resize(n);
  fft(A, false);
  fft(B, false);
  for (int i = 0; i < n; i++) {
    A[i] = A[i] * B[i];
  }
  fft(A, true);
  c.resize(n);
  for (int i = 0; i < n; i++) c[i] = (int)(A[i].real() + 0.5);
}
int solve() {
  int n, first, second;
  cin >> n >> first >> second;
  vector<int> a(n + 2), b(n + 2);
  vector<int> A(s + 1), B(s + 1);
  memset(ans, -1, sizeof(ans));
  for (int i = 1; i < n + 2; i++) {
    cin >> a[i];
    b[i] = s - a[i];
    A[a[i]] = 1;
    B[b[i]] = 1;
  }
  vector<int> c;
  multiply(A, B, c);
  while (c.back() == 0) c.pop_back();
  for (int i = s + 1; i < (int)c.size(); i++) {
    if (c[i]) {
      int p = 2 * (i - s) + 2 * second;
      for (int j = p; j <= 1e6; j += p) {
        maxs(ans[j], p);
      }
    }
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int t;
    cin >> t;
    cout << ans[t] << " ";
  }
  return 0;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
