#include <bits/stdc++.h>
using namespace std;
vector<int> factor[1000005];
int ans[1000005];
int n, m, i, t, g[524288];
complex<double> a[524288], b[524288];
void FFTinit() {
  for (i = 1; i < 524288; i++) g[i] = g[i >> 1] >> 1 | ((i & 1) << 18);
}
void FFT(complex<double> *a, int f) {
  int i, j, k, p;
  for (i = 0; i < 524288; i++)
    if (g[i] > i) swap(a[i], a[g[i]]);
  for (i = 1; i < 524288; i <<= 1) {
    complex<double> e(cos(acos(-1) / i), f * sin(acos(-1) / i));
    for (j = 0; j < 524288; j += i << 1) {
      complex<double> w(1, 0);
      for (k = 0; k < i; k++, w *= e) {
        complex<double> first = a[j + k], second = w * a[j + k + i];
        a[j + k] = first + second;
        a[j + k + i] = first - second;
      }
    }
  }
}
int ans2[500005];
void solve() {
  for (int i = 2; i < 1000005; i += 2) {
    for (int j = i; j < 1000005; j += i) {
      factor[j].push_back(i);
    }
  }
  int nn, first, second;
  scanf("%d %d %d", &nn, &first, &second);
  int A[200005];
  for (int i = 0; i <= nn; i++) {
    scanf("%d", &A[i]);
    a[A[i]] = 1;
    b[first - A[i]] = 1;
  }
  n = first, m = first;
  FFTinit();
  FFT(a, 1);
  FFT(b, 1);
  for (int i = 0; i < 524288; i++) a[i] = a[i] * b[i];
  FFT(a, -1);
  for (int i = first; i <= 2 * first; i++) {
    if ((int)(a[i].real() / 524288 + 0.5)) {
      ans2[i - first] = 1;
    }
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int first;
    scanf("%d", &first);
    if (ans[first]) {
      printf("%d ", ans[first]);
    } else {
      int res = -1;
      for (auto it : factor[first]) {
        if (it / 2 > second && it / 2 <= first + second &&
            ans2[it / 2 - second]) {
          res = max(res, it);
        }
      }
      printf("%d ", ans[first] = res);
    }
  }
  printf("\n");
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
}
