#include <bits/stdc++.h>   using namespace std;   long long MOD = 1000000007;   long double EPS = 1e-9;   long long binpow(long long b, long long p, long long mod) {     long long ans = 1;     b %= mod;     for (; p; p >>= 1) {       if (p & 1) ans = ans * b % mod;       b = b * b % mod;     }     return ans;   }   void pre() {}   namespace GetPrimitve {   vector<long long> Divisors;   vector<long long> Divisor(long long x) {     vector<long long> ans;     for (long long i = 2; i * i <= x; i++) {       if (x % i == 0) {         ans.emplace_back(i);         while (x % i == 0) x /= i;       }     }     if (x > 1) ans.emplace_back(x);     return ans;   }   bool check(int prim, int p, vector<long long> &divs) {     for (auto v : divs) {       if (binpow(prim, (p - 1) / v, p) == 1) return 0;     }     return 1;   }   int getRoot(int p) {     int ans = 2;     vector<long long> divs = Divisor(p - 1);     while (!check(ans, p, divs)) ans++;     return ans;   }   };  // namespace GetPrimitve   const long long MAXB = 1 << 21;   using polybase = long long;   polybase A[MAXB], B[MAXB], C[MAXB];   template <long long NTTMOD, long long PRIMITIVE_ROOT>   struct POLYMUL {     long long modInv(long long a) {       return a <= 1                  ? a                  : (long long)(NTTMOD - NTTMOD / a) * modInv(NTTMOD % a) % NTTMOD;     }     void NTT(polybase P[], long long n, long long oper) {       for (int i = 1, j = 0; i < n - 1; i++) {         for (int s = n; j ^= s >>= 1, ~j & s;)           ;         if (i < j) swap(P[i], P[j]);       }       for (int d = 0; (1 << d) < n; d++) {         int m = 1 << d, m2 = m * 2;         long long unit_p0 = ::binpow(PRIMITIVE_ROOT, (NTTMOD - 1) / m2, NTTMOD);         if (oper < 0) unit_p0 = modInv(unit_p0);         for (int i = 0; i < n; i += m2) {           polybase unit = 1;           for (int j = 0; j < m; j++) {             polybase &P1 = P[i + j + m], &P2 = P[i + j];             polybase t = unit * P1 % NTTMOD;             P1 = (P2 - t + NTTMOD) % NTTMOD;             P2 = (P2 + t) % NTTMOD;             unit = unit * unit_p0 % NTTMOD;           }         }       }     }     vector<polybase> mul(const vector<polybase> &a, const vector<polybase> &b) {       vector<polybase> ret(           max(0LL, (long long)a.size() + (long long)b.size() - 1), 0);       int len = 1;       while (len < (long long)ret.size()) len <<= 1;       for (int i = 0; i < len; i++) A[i] = i < (int)a.size() ? a[i] : 0;       for (int i = 0; i < len; i++) B[i] = i < (int)b.size() ? b[i] : 0;       NTT(A, len, 1);       NTT(B, len, 1);       for (long long i = 0; i < len; i++) C[i] = (polybase)A[i] * B[i] % NTTMOD;       NTT(C, len, -1);       for (long long i = 0, inv = modInv(len); i < (long long)ret.size(); i++)         ret[i] = (long long)C[i] * inv % NTTMOD;       return ret;     }     vector<long long> binpow(vector<long long> b, long long p) {       vector<long long> ans = vector<long long>(1, 1);       for (; p; p >>= 1) {         if (p & 1) ans = mul(ans, b);         b = mul(b, b);       }       return ans;     }     vector<long long> calc(vector<long long> &arr, int l, int r) {       if (l == r) {         return {};       }       int mid = (l + r) >> 1;       vector<long long> x = calc(arr, l, mid), y = calc(arr, mid + 1, r);       return mul(x, y);     }   };   POLYMUL<998244353, 3> ntt1;   POLYMUL<943718401, 7> ntt2;   POLYMUL<950009857, 7> ntt3;   POLYMUL<962592769, 7> ntt4;   POLYMUL<975175681, 17> ntt5;   long long possible[1000100];   long long lappos[1000100];   void solve() {     long long n, x, y;     cin >> n >> x >> y;     vector<long long> arr(n + 1);     for (long long i = 0; i < (n + 1); ++i) {       cin >> arr[i];     }     vector<long long> arr2 = arr;     for (long long i = 0; i < (n + 1); ++i) {       arr2[i] = -arr2[i];       arr2[i] += x;     }     vector<long long> poly1(x + 1);     vector<long long> poly2(x + 1);     for (auto v : arr) {       poly1[v] = 1;     }     for (auto v : arr2) {       poly2[v] = 1;     }     vector<long long> pp1 = ntt2.mul(poly1, poly2);     vector<long long> pp2 = ntt3.mul(poly1, poly2);     for (long long i = x + 1; i <= 2 * x; ++i) {       if (pp1[i] > 0 || pp2[i] > 0) {         possible[i - x] = 1;       }     }     assert(possible[x] == 1);     memset(lappos, -1, sizeof(lappos));     for (long long i = 1; i <= 1000000; ++i) {       if (possible[i]) {         if (2 * (i + y) <= 1000000) {           lappos[2 * (i + y)] = 2 * (i + y);         }       }     }     for (long long i = 1; i <= 1000000; ++i) {       for (long long j = 2 * i; j <= 1000000; j += i) {         (lappos[j] = max((lappos[j]), (lappos[i])));       }     }     long long q;     cin >> q;     for (long long i = 0; i < (q); ++i) {       long long x;       cin >> x;       cout << lappos[x] <<    ;     }     cout <<   n ;   }   signed main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     pre();     long long _t = 1;     srand(time(0));     for (long long i = 1; i <= _t; i++) {       solve();     }   }