Problem Selection

This is your last test before the summer break. You had prepared for the test, but this time your teacher has prepared something special for you, he gave you ‘N’ problems and an array ‘A’ of length ‘N’, where each problem gives you A[i] marks if you answer it. The teacher has given some constraints on how you can answer the question. Every time you answer a question, he will block ‘K’ questions of your choice that has not been answered or blocked yet. If you have fewer than ‘K’ questions, he will block all the questions. Once a question is blocked, you can not answer it. Since you prepared last night, you know the answers to all the problems. Now you are wondering what’s the minimum and maximum marks you can achieve in the test.

Note: You cannot leave the test until all the questions are either answered or blocked. You will never answer a question incorrectly.

Input Format-

First-line contains ‘T’, denoting the number of Test cases.
For each Test case:
The first line contains two integers, ‘N’ and ‘K’.
The following line contains the array ‘A’ of the length ‘N’, denoting the marks you will get to answer the problems.

Output Format-

For each test case, You have to print two space-separated integers denoting the minimum and maximum marks that you can achieve in the test.

Note :

You don’t need to print anything. It has already been taken care of. Just implement the given function.

Constraints -

1 <= ‘T’ <= 5
1 <= ‘N’ <= 10^5
0 <= ‘K’ <= ‘N - 1’ 
1 <= A[i] <= 10^5, i ∈  (1,N) 


Time Limit: 1 sec