Today is Annie’s 18th birthday. So Uncle John has given her N boxes of chocolate as a gift. But there is a restriction; she can’t take all the boxes of chocolate. She can take exactly M boxes of chocolate and rest of the boxes will be given her younger brother. i^th box contains x_i chocolates. Now UncleJohn shuffles all the boxes. Now Annie chooses M boxes blindly. What is the maximum and minimum number of chocolate that she can get?

Input: 

Input starts with an integer T (T≤100) denoting the number of test cases. Each case starts with two space separated integers N and M (1≤N≤1000), (1≤M≤N). Then next N line contains N integers, where i^th integer denotes the number of chocolate xi(1≤ x_i ≤1000) in the i^th box.

Output:

For each case, print the case number, maximum and minimum number of chocolate that Annie can get.

Sample:

Authored By: Tanvir Hasan Anick