Problem: In the last war of PMP, he defeated all his opponents and advanced to the final round. But after the end of semi-final round evil attacked him from behind and killed him! God bless him. 

Before his death, PMP signed a contract with the bus rapid transit (BRT) that improves public transportations by optimizing time of travel estimation. You should help PMP finish his last contract.

Each BRT line is straight line that passes n intersecting on its ways. At each intersection there is traffic light that periodically cycles between green and red. It starts illuminating green at time zero. During the green phase which lasts for g seconds, traffic is allowed to proceed. After the green phase the light changes to red and remains in this color for r seconds. During the red phase traffic is prohibited from proceeding. If a vehicle reaches the intersection exactly at a time when the light changes to red, it should stop, but the vehicle is clear to proceed if the light has just changed to green.

<image>

All traffic lights have the same timing and are synchronized. In other words the period of red (and green) phase is the same for all of traffic lights and they all start illuminating green at time zero.

The BRT Company has calculated the time that a bus requires to pass each road segment. A road segment is the distance between two consecutive traffic lights or between a traffic light and source (or destination) station. More precisely BRT specialists provide n + 1 positive integers li, the time in seconds that a bus needs to traverse i-th road segment in the path from source to destination. The l1 value denotes the time that a bus needs to pass the distance between source and the first intersection. The ln + 1 value denotes the time between the last intersection and destination.

In one day q buses leave the source station. The i-th bus starts from source at time ti (in seconds). Decision makers of BRT Company want to know what time a bus gets to destination?

The bus is considered as point. A bus will always move if it can. The buses do not interfere with each other. 

Input

The first line of input contains three space-separated positive integers n, g, r (1 ≤ n ≤ 105, 2 ≤ g + r ≤ 109) — the number of intersections, duration of green phase and duration of red phase. Next line contains n + 1 integers li (1 ≤ li ≤ 109) — the time to pass the i-th road segment in the path from source to destination. 

Next line contains a single integer q (1 ≤ q ≤ 105) — the number of buses in a day. The i-th of next q lines contains a single integer ti (1 ≤ ti ≤ 109) — the time when i-th bus leaves the source station.

Output

In the i-th line of output you should print a single integer — the time that i-th bus gets to destination.

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.

Examples

Input

1 3 2
5 2
5
1
2
3
4
5


Output

8
9
12
12
12


Input

5 3 7
10 1 1 8 900000005 1000000000
3
1
10
1000000000


Output

1900000040
1900000040
2900000030

Note

In the first sample, buses #1, #2 and #5 will reach the destination without waiting behind the red light. But buses #3 and #4 should wait.

In the second sample, first bus should wait at third, fourth and fifth intersections. Second and third buses should wait only at the fifth intersection.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int kInf = 0x3f3f3f3f;
const int kNMax = 100010;
const int kDisMax = kNMax * 7;
int dis[kDisMax], nDis;
int n, g, r, p, q, L[kNMax], t[kNMax], s[kNMax];
long long ans[kNMax], S[kNMax], f[kNMax];
int fetch(int x) {
  int res = lower_bound(dis, dis + nDis, x) - dis;
  if (!(dis[res] == x)) assert(0);
  return res;
}
void addDis(int x) {
  if (0 <= x && x < p) dis[nDis++] = x;
}
struct Node {
  int l, r, val;
} node[kDisMax * 4];
void update(int i) { node[i].val = min(node[i * 2].val, node[i * 2 + 1].val); }
void build(int i, int l, int r) {
  node[i].l = l, node[i].r = r;
  node[i].val = kInf;
  if (l == r) return;
  int mid = (l + r) / 2;
  build(i * 2, l, mid);
  build(i * 2 + 1, mid + 1, r);
}
int askMin(int i, int l, int r) {
  if (node[i].l > r || node[i].r < l) return kInf;
  if (l <= node[i].l && node[i].r <= r) return node[i].val;
  return min(askMin(i * 2, l, r), askMin(i * 2 + 1, l, r));
}
int askMin(int l, int r) {
  if (l < 0) l = 0;
  if (r >= p) r = p - 1;
  if (l > r) return kInf;
  l = fetch(l);
  r = fetch(r);
  if (l > r || l < 0 || r >= nDis) return kInf;
  return askMin(1, l, r);
}
void insert(int p, int val) {
  p = fetch(p);
  int cur = 1;
  while (1) {
    if (node[cur].l == node[cur].r) break;
    int mid = (node[cur].l + node[cur].r) / 2;
    if (p <= mid)
      cur = cur * 2;
    else
      cur = cur * 2 + 1;
  }
  node[cur].val = val;
  for (cur >>= 1; cur; cur >>= 1) update(cur);
}
int main() {
  scanf("%d%d%d", &n, &g, &r);
  p = g + r;
  for (int i = 1; i <= n + 1; i++) {
    scanf("%d", &L[i]);
    s[i] = (L[i] + s[i - 1]) % p;
    S[i] = S[i - 1] + L[i];
  }
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) scanf("%d", &t[i]);
  addDis(0);
  addDis(p - 1);
  for (int i = 1; i <= n; i++) {
    addDis(s[i]);
    addDis(s[i] - 1);
    addDis(g + s[i] - p);
    addDis(g + s[i]);
  }
  for (int i = 1; i <= q; i++) {
    addDis(g - t[i] % p);
    addDis(p - t[i] % p - 1);
    addDis(g + p - t[i] % p);
  }
  sort(dis, dis + nDis);
  nDis = unique(dis, dis + nDis) - dis;
  build(1, 0, nDis - 1);
  for (int i = n; i >= 1; i--) {
    int k = min(askMin(g + s[i] - p, s[i] - 1), askMin(g + s[i], p - 1));
    if (k == kInf)
      f[i] = S[n + 1] - S[i];
    else
      f[i] = S[k] - S[i] + (p - (s[k] - s[i] + p) % p) + f[k];
    insert(s[i], i);
  }
  for (int i = 1; i <= q; i++) {
    int k = min(askMin(g - t[i] % p, p - t[i] % p - 1),
                askMin(g + p - t[i] % p, p - 1));
    if (k == kInf)
      ans[i] = t[i] + S[n + 1];
    else
      ans[i] = t[i] + S[k] + (p - (t[i] % p + s[k]) % p) + f[k];
  }
  for (int i = 1; i <= q; i++)
    printf(
        "%lld"
        "\n",
        ans[i]);
}