John is given $2$ square tiles, initially both of whose sides have length l placed in an x $-$ y plane. Initially, the bottom left corners of each square are at 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 s$1$ and s$2.$

For each querydetermine the time at which the overlapping area of tiles is equal to the query value, queries$[$i$].$

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

This squares are going the same direction x$=$y line.

Function Description:

Complete the movingTiles function in java below.

movingTiles has the following parameter$($s$)$:

$$ int l: side length for the squares.

$$ int s$1$: velocity of square $1.$

$$ int s$2$: velocity of square $2.$

$$ int queries$[$q$]$: the array of queries.

Returns:

$$ int: an array of answers to the queries, in order. Each answer will be considered correct if it is at most $0\mathrm{.}0001$ away from the true answer.

Input Format:

First line contains integers l$,$ s$1,$ s$2.$

The next line contains q$,$ the number of queries.

Each of the next q lines consists of one integer queries$[$i$]$ in one line.

Sample Input

$1012$

$2$

$50$

$100$

Sample Output

$4\mathrm{.}1421$

$0\mathrm{.}0000$

Explanation

For the first case, note that the answer is around $4\mathrm{.}1421356237...,$ so any of following will be accepted:

$4\mathrm{.}1421356237$

$4\mathrm{.}14214$

$4\mathrm{.}14215000$

$4\mathrm{.}1421$

$4\mathrm{.}1422$