UVALive 3635 Pie （二分）

3635 - Pie

My birthdayis coming up and traditionally I'm serving

pie. Notjust one pie, no, I have a number N of them,

of varioustastes and of various sizes. F of my friends

are comingto my party and each of them gets a piece

of pie. Thisshould be one piece of one pie, not several

small piecessince that looks messy. This piece can be

one wholepie though.

My friendsare very annoying and if one of them gets

a biggerpiece than the others, they start complaining.

Thereforeall of them should get equally sized (but not

necessarilyequally shaped) pieces, even if this leads to

some piegetting spoiled (which is better than spoiling

the party).Of course, I want a piece of pie for myself too, and that piece should also beof the same

size.

What is thelargest possible piece size all of us can get? All the pies are cylindrical inshape and

they allhave the same height 1, but the radii of the pies can be different.

Input

One linewith a positive integer: the number of test cases. Then for each test case:

_ One line with two integers N and F with 1_ N, F _ 10000: the number of pies and the number

of friends.

_ One line with N integers ri with 1 _ ri _ 10000: the radii of the pies.

Output

For eachtest case, output one line with the largest possible volumeV such that me and my friends can

all get apie piece of size V . The answer should be given as a oatingpoint number with an absolute

error of atmost 10