#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int m = 1 << 20;
int n, k, q;
int a[m];
complex<double> va[m], vb[m];
void fft(complex<double> v[m], int t = 0) {
  for (int i = 1, j = 0, l; i < m; i++) {
    for (l = m >> 1; j & l; l >>= 1) j ^= l;
    j ^= l;
    if (i < j) swap(v[i], v[j]);
  }
  for (int l = 1; l < m; l <<= 1) {
    double ang = PI / l * (1 - 2 * t);
    complex<double> wl(cos(ang), sin(ang));
    for (int i = 0; i < m; i += (l << 1)) {
      complex<double> w(1);
      for (int j = 0; j < l; j++) {
        complex<double> x = v[i + j], y = w * v[i + j + l];
        v[i + j] = x + y, v[i + j + l] = x - y;
        w *= wl;
      }
    }
  }
  if (t)
    for (int i = 0; i < m; i++) v[i] /= m;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> k;
  for (int i = 0; i <= n; i++) {
    int x;
    cin >> x;
    va[m / 4 + x] = 1, vb[m / 4 - x] = 1;
  }
  fft(va), fft(vb);
  for (int i = 0; i < m; i++) va[i] *= vb[i];
  fft(va, 1);
  memset(a, -1, sizeof(a));
  for (int i = 1; 2 * i < m; i++)
    if (round(va[m / 2 + i].real())) {
      int x = 2 * (i + k);
      for (int j = x; j < m; j += x) a[j] = max(a[j], x);
    }
  cin >> q;
  while (q--) {
    int x;
    cin >> x;
    cout << a[x] << (q ? ' ' : '\n');
  }
  return 0;
}
