#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool get_int(T &x) {
  char t = getchar();
  bool neg = false;
  x = 0;
  for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
    ;
  if (t == '-') neg = true, t = getchar();
  if (t == EOF) return false;
  for (; t <= '9' && t >= '0'; t = getchar()) x = x * 10 + t - '0';
  if (neg) x = -x;
  return true;
}
template <typename T>
void print_int(T x) {
  if (x < 0) putchar('-'), x = -x;
  short a[20] = {}, sz = 0;
  while (x > 0) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
const int inf = 0x3f3f3f3f;
const long long Linf = 1ll << 61;
const double pi = acos(-1.0);
int n, q;
long long l[100111], t[100111], sum[100111], ans[100111], g, r, c;
bool cmp(int x, int y) {
  return (c - t[x] % c + c) % c < (c - t[y] % c + c) % c;
}
set<pair<int, pair<int, int> > > st;
void addseg(pair<int, int> x, long long v) {
  sum[x.first] += v;
  sum[x.second + 1] -= v;
  if (x.first > x.second) sum[1] += v;
}
pair<int, int> combine(pair<int, int> a, pair<int, int> b) {
  if (a.first == 0) return b;
  return make_pair(a.first, b.second);
}
void go(long long now) {
  int tl = now % c, tr = (now % c + r + c) % c;
  if (tl <= tr) {
    pair<int, int> cur = make_pair(0, 0);
    for (auto v = st.lower_bound(make_pair(tl, make_pair(0, 0))), nv = v;
         v != st.end() && v->first <= tr; v = nv) {
      addseg(v->second, (v->first - tl + c) % c);
      cur = combine(cur, v->second);
      nv = v;
      nv++;
      st.erase(v);
    }
    if (cur.first) st.insert(make_pair(tl, cur));
  } else {
    pair<int, int> cur = make_pair(0, 0);
    for (auto v = st.lower_bound(make_pair(tl, make_pair(0, 0))), nv = v;
         v != st.end(); v = nv) {
      addseg(v->second, (v->first - tl + c) % c);
      cur = combine(cur, v->second);
      nv = v;
      nv++;
      st.erase(v);
    }
    for (auto v = st.begin(), nv = v; v != st.end() && v->first <= tr; v = nv) {
      addseg(v->second, (v->first - tl + c) % c);
      cur = combine(cur, v->second);
      nv = v;
      nv++;
      st.erase(v);
    }
    if (cur.first) st.insert(make_pair(tl, cur));
  }
}
int ord[100111];
int main() {
  (get_int(n) && (get_int(g) && get_int(r)));
  c = g + r;
  for (int i = 1; i <= n + 1; i++) {
    get_int(l[i]);
    l[i] += l[i - 1];
  }
  get_int(q);
  for (int i = 1; i <= q; i++) {
    ord[i] = i;
    get_int(t[i]);
  }
  sort(ord + 1, ord + q + 1, cmp);
  for (int i = 1; i <= q; i++)
    st.insert(make_pair((c - t[ord[i]] % c) % c, make_pair(i, i)));
  for (int i = 1; i <= n; i++) go(l[i]);
  for (int i = 1; i <= q; i++) {
    sum[i] += sum[i - 1];
    ans[ord[i]] = sum[i] + t[ord[i]] + l[n + 1];
  }
  for (int i = 1; i <= q; i++) printf("%I64d\n", ans[i]);
  return 0;
}
