You are given a regular pentagon of edge length L. There are 5 cars 1, 2, 3, 4, 5 situated at the vertices of the pentagon. Each car is following its neighbour with speed v. See the following figure for more clarity.

So you need to tell the time when they all will meet.

Input :
T : Number of test cases
Each test case will contain a line consisting of 2 integers
L : Length of an edge of pentagon
V : Speed of each car

Output :
Answer must contain a decimal number precise upto 6 decimal places.

Constraints : :
1 <= T <= 1000000
1 <= L <= 1000000
1 <= V <= 1000

Use pi = 3.14159265 if you need.