Limits 1s, 512 MB

As you might know Mr Montu Mia is very passionate about any challenges he faces. One day he went to the famous Nurjahan restaurant at Bottola, Jahangirnagar University. Recognizing him the restaurant owner challenged him to climb the biggest pillar and said that if he can climb the pillar successfully he will be rewarded a free grill and nun at dinner.

The pillar is of height HH and radius RR. And Montu Mia wishes to climb the pillar at a specific angle of with the ground all the time. Now he wonders can he reach the top and how much distance he will have to walk to reach the top of the pillar.

Input

Input starts with an integer TT (T10000T ≤ 10000), denoting the number of test cases. Each case contains three integer numbers HH (0<H5000 < H ≤ 500) denoting the height, RR (0<R5000 < R ≤ 500) denoting the radius and θ\theta (0θ900 ≤ \theta ≤ 90) denoting the angle.

Output

For each case, print the distance rounded to two places after the decimal point or print “Montu Mia, Super Dumb!” without quote if he fails to reach the top of the pillar at all.

Sample

InputOutput
2
10 5 90
10 5 45

10.00
14.14

Submit

Login to submit.

Statistics

76% Solution Ratio
SHOVON26Earliest, Apr '18
Azizul_cse27Fastest, 0.0s
SHOVON26Lightest, 131 kB
MatrixShortest, 186B
Toph uses cookies. By continuing you agree to our Cookie Policy.