Sherlock is given 2 square tiles, initially both of whose sides have length L placed in an x-y plane; 
so that the bottom left corner of each square coincides with the the origin and their sides are 
parallel to the axes.

At t=0, both squares start moving along line y=x (along the positive x and y) with velocities S1 and S2.

For each query of form q, Sherlock has to report the time at which the overlapping area of tiles is 
equal to q.

Note: Assume all distances in meter, time in seconds and velocities in meter per second.

Input Format 
First line contains integers L,S1,S2. Next line contains Q, the number of queries. Each of the next Q 
lines consists of one integer q in one line.

Constraints 
 1. 1<=L,S1,S2<=10^9
 2. 1<=Q<=10^5
 3. 1<=q<=L^2
 4. S1!=S2

Output Format 
For each query, print the required answer in one line. Your answer will be considered correct if it 
is at most 0.0001 away from the true answer.

Sample input:
10 1 2
2
50
100

Sample output:
4.1421
0.0000