BLCONE - Painting Hat


In preparations for Joffrey's birthday party, his mom, named Cersei, assigns her employees to paint the hats to be used in the party. Each hat is cone shaped with height H and radius R. Cersei and her employees then go to the store to buy the paint. Since there is no container for the paint, all bought paint will be stored inside each hat.

Here is how the paint is stored:

hat

It is known that 1 unit of paint volume is enough to paint exactly 1 unit of hat area. To be as efficient as possible, all bought paint must be used to paint the hat. Each hat will be filled with paint until it reaches a height h. All the paint inside the hat must be used to paint that hat inside and out (ignore depth). Part of the hat that have been submerged in paint don't need to be painted. If the hat can't contain enough paint, it's filled until it's full.

Input

First line is N, number of birthday parties (1 ≤ N ≤ 10000). Next N line contains the hat used in each birthday party, containing 2 integers R and H (1 ≤ R, H ≤ 100)

Output

For each birthday party, output h, the height of paint that Cersei bought. Output until 6 digit after decimal point.

Example

Input:
3
4 6
6 4
2 10

Output:
5.874692
3.916461
10.000000


Added by:Andy
Date:2016-07-14
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU JS-MONKEY
Resource:BLPCS3