#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
namespace FFT {
int N;
vector<int> perm;
void precalculate() {
  perm.resize(N);
  perm[0] = 0;
  for (int k = 1; k < N; k <<= 1) {
    for (int i = 0; i < k; i++) {
      perm[i] <<= 1;
      perm[i + k] = 1 + perm[i];
    }
  }
}
void fft(vector<complex<double> > &v, bool invert = false) {
  if (v.size() != perm.size()) {
    N = v.size();
    assert(N && (N & (N - 1)) == 0);
    precalculate();
  }
  for (int i = 0; i < N; i++)
    if (i < perm[i]) swap(v[i], v[perm[i]]);
  for (int len = 2; len <= N; len <<= 1) {
    double angle = 2 * PI / len;
    if (invert) angle = -angle;
    complex<double> factor = polar(1.0, angle);
    for (int i = 0; i < N; i += len) {
      complex<double> w(1);
      for (int j = 0; j < len / 2; j++) {
        complex<double> x = v[i + j], y = w * v[i + j + len / 2];
        v[i + j] = x + y;
        v[i + j + len / 2] = x - y;
        w *= factor;
      }
    }
  }
  if (invert)
    for (complex<double> &x : v) x /= N;
}
vector<long long> multiply(const vector<long long> &a,
                           const vector<long long> &b) {
  vector<complex<double> > fa(a.begin(), a.end()), fb(b.begin(), b.end());
  int n = 1;
  while (n < a.size() + b.size()) n <<= 1;
  fa.resize(n);
  fb.resize(n);
  fft(fa);
  fft(fb);
  for (int i = 0; i < n; i++) fa[i] *= fb[i];
  fft(fa, true);
  vector<long long> ans(n);
  for (int i = 0; i < n; i++) ans[i] = round(fa[i].real());
  return ans;
}
}  // namespace FFT
const int N = 1e6 + 7;
int ans[N];
int main() {
  int n, x, y;
  cin >> n >> x >> y;
  vector<long long> a(x + 1), b(x + 1);
  for (int i = 0; i <= n; i++) {
    int z;
    cin >> z;
    a[z] = b[x - z] = 1;
  }
  a = FFT::multiply(a, b);
  for (int i = x + 1; i <= 2 * x; i++) {
    if (a[i] == 0) continue;
    int z = i - x + y;
    for (int k = z; k < N; k += z) ans[k] = z;
  }
  int q;
  cin >> q;
  while (q--) {
    int x;
    cin >> x;
    int res = ans[x / 2] * 2;
    if (res == 0) res--;
    cout << res << "\n";
  }
}
