Problem: There is a light source on the plane. This source is so small that it can be represented as point. The light source is moving from point (a, s_y) to the (b, s_y) (s_y < 0) with speed equal to 1 unit per second. The trajectory of this light source is a straight segment connecting these two points. 

There is also a fence on OX axis represented as n segments (l_i, r_i) (so the actual coordinates of endpoints of each segment are (l_i, 0) and (r_i, 0)). The point (x, y) is in the shade if segment connecting (x,y) and the current position of the light source intersects or touches with any segment of the fence.

<image>

You are given q points. For each point calculate total time of this point being in the shade, while the light source is moving from (a, s_y) to the (b, s_y).

Input

First line contains three space separated integers s_y, a and b (-10^9 ≤ s_y < 0, 1 ≤ a < b ≤ 10^9) — corresponding coordinates of the light source.

Second line contains single integer n (1 ≤ n ≤ 2 ⋅ 10^5) — number of segments in the fence.

Next n lines contain two integers per line: l_i and r_i (1 ≤ l_i < r_i ≤ 10^9, r_{i - 1} < l_i) — segments in the fence in increasing order. Segments don't intersect or touch each other.

Next line contains single integer q (1 ≤ q ≤ 2 ⋅ 10^5) — number of points to check.

Next q lines contain two integers per line: x_i and y_i (1 ≤ x_i, y_i ≤ 10^9) — points to process.

Output

Print q lines. The i-th line should contain one real number — total time of the i-th point being in the shade, while the light source is moving from (a, s_y) to the (b, s_y). The answer is considered as correct if its absolute of relative error doesn't exceed 10^{-6}.

Example

Input

-3 1 6
2
2 4
6 7
5
3 1
1 3
6 1
6 4
7 6


Output

5.000000000000000
3.000000000000000
0.000000000000000
1.500000000000000
2.000000000000000

Note

  * The 1-st point is always in the shade; 
  * the 2-nd point is in the shade while light source is moving from (3, -3) to (6, -3); 
  * the 3-rd point is in the shade while light source is at point (6, -3). 
  * the 4-th point is in the shade while light source is moving from (1, -3) to (2.5, -3) and at point (6, -3); 
  * the 5-th point is in the shade while light source is moving from (1, -3) to (2.5, -3) and from (5.5, -3) to (6, -3); 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int MAXN = 200100;
double seq[MAXN];
int l[MAXN], r[MAXN];
int main() {
  int sy, a, b, x, y, n, q;
  scanf("%d%d%d", &sy, &a, &b);
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d%d", l + i, r + i);
  std::sort(l + 1, l + n + 1);
  std::sort(r + 1, r + n + 1);
  seq[0] = 0.0;
  for (int i = 1; i <= n; ++i) seq[i] = seq[i - 1] + r[i] - l[i];
  seq[n + 1] = seq[n];
  scanf("%d", &q);
  while (q--) {
    double ax, bx;
    scanf("%d%d", &x, &y);
    if (x == a)
      ax = a;
    else {
      double k = 1.0 * (y - sy) / (x - a);
      ax = -sy / k + a;
    }
    if (x == b)
      bx = b;
    else {
      double k = 1.0 * (y - sy) / (x - b);
      bx = -sy / k + b;
    }
    int idx_a = std::lower_bound(l + 1, l + n + 1, ax) - l,
        idx_b = std::lower_bound(l + 1, l + n + 1, bx) - l;
    double ans = seq[idx_b - 1] - seq[idx_a - 1];
    if (idx_a - 1 && ax < r[idx_a - 1]) ans += r[idx_a - 1] - ax;
    if (idx_b - 1 && bx < r[idx_b - 1]) ans -= r[idx_b - 1] - bx;
    ans = ans / (bx - ax) * (b - a);
    printf("%.10f\n", ans);
  }
  return 0;
}