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); 
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Edu_48E {

	static long lY;
	static long lS;
	static long lE;
	static long lLen;

	static int nS;

	static long[] segS;
	static long[] segE;

	static long[] preSum;

	public static void main(String[] args) throws IOException {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter printer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		StringTokenizer inputData = new StringTokenizer(reader.readLine());
		lY = Integer.parseInt(inputData.nextToken());
		lS = Integer.parseInt(inputData.nextToken());
		lE = Integer.parseInt(inputData.nextToken());
		lLen = lE - lS;

		nS = Integer.parseInt(reader.readLine());
		segS = new long[nS];
		segE = new long[nS];
		for (int i = 0; i < nS; i++) {
			inputData = new StringTokenizer(reader.readLine());
			segS[i] = Integer.parseInt(inputData.nextToken());
			segE[i] = Integer.parseInt(inputData.nextToken());
		}

		preSum = new long[nS];

		preSum[0] = segE[0] - segS[0];
		for (int i = 1; i < nS; i++) {
			preSum[i] = preSum[i - 1] + segE[i] - segS[i];
		}

		int nQ = Integer.parseInt(reader.readLine());

		while (nQ-- > 0) {
			inputData = new StringTokenizer(reader.readLine());
			printer.println(query(Integer.parseInt(inputData.nextToken()), Integer.parseInt(inputData.nextToken())));
		}
		printer.close();
	}

	static double query(long x, long y) {
		double ratio = ((double) y) / (y - lY);
		double pLS = ratio * (lS - x) + x;
		double pLE = ratio * (lE - x) + x;

		int iL = searchGE(pLS);
		int iR = searchLE(pLE);

		double sum = 0;
		if (iL <= iR) {
			sum += preSum[iR];
			if (iL != 0) {
				sum -= preSum[iL - 1];
			}
		}

		if (iL > 0) {
			if (pLS < segE[iL - 1]) {
				sum += Math.min(pLE, segE[iL - 1]) - pLS;
			}
		}

		if (iR + 1 < nS && iR + 1 != iL - 1) {
			if (segS[iR + 1] < pLE) {
				sum += pLE - Math.max(pLS, segS[iR + 1]);
			}
		}
		return (1 / ratio) * sum;
	}

	static int searchGE(double index) {
		int low = 0;
		int high = nS;
		while (low != high) {
			int mid = (low + high) >> 1;
			if (index <= segS[mid]) {
				high = mid;
			} else {
				low = mid + 1;
			}
		}
		return low;
	}

	static int searchLE(double index) {
		int low = -1;
		int high = nS - 1;
		while (low != high) {
			int mid = (low + high + 1) >> 1;
			if (segE[mid] <= index) {
				low = mid;
			} else {
				high = mid - 1;
			}
		}
		return low;
	}
}