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); 
#include <bits/stdc++.h>
using namespace std;
const long long M = 998244353;
const long long NMAX = 400011;
const long long inf = 1E9;
const long double eps = 1e-9;
const long long base = 29;
long long z[NMAX];
long long sum[NMAX];
signed main() {
  cin.tie(0);
  cout.tie(0);
  cin.sync_with_stdio(0);
  cout.sync_with_stdio(0);
  cout.precision(20);
  long long s, a, b;
  cin >> s >> a >> b;
  long long n;
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    long long l, r;
    cin >> l >> r;
    z[2 * i - 1] = l;
    z[2 * i] = r;
  }
  for (long long i = 1; i <= n; i++) {
    sum[2 * i - 1] = sum[2 * i - 2] - z[2 * i - 1];
    sum[2 * i] = sum[2 * i - 1] + z[2 * i];
  }
  long long q;
  cin >> q;
  for (long long i = 0; i < q; i++) {
    long long x, y;
    cin >> x >> y;
    long double l = x + (a - x) * y / (long double)(y - s);
    long double r = x + (b - x) * y / (long double)(y - s);
    long double suml = 0;
    auto u = upper_bound(z, z + 2 * n + 1, l) - z;
    u--;
    if ((u) % 2 == 0) {
      suml = sum[u];
    } else {
      suml = l + sum[u];
    }
    auto v = upper_bound(z, z + 2 * n + 1, r) - z;
    v--;
    long double sumr = 0;
    if ((v) % 2 == 0) {
      sumr = sum[v];
    } else {
      sumr = r + sum[v];
    }
    cout << (sumr - suml) * (y - s) / y << endl;
  }
  return 0;
};
