J. Lazy Abdo
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

This is one of the main reasons why Da7doo7 gets fired a lot.

Da7doo7 always gets extremely frustrated with Tinky-Winky's laziness and decides to assign him some tasks. There are a total of $$$n$$$ tasks, the $$$i$$$-th of which requires a certain number of minutes denoted by $$$a_i$$$. Da7doo7 wants Tinky-Winky to handle $$$k$$$ of these tasks.

Your task is to select the $$$k$$$ tasks in a way that maximizes the amount of time Tinky-Winky spends on them. In other words, you need to choose the tasks that have the highest total time requirement, allowing Tinky-Winky to be occupied for as long as possible.

Help Da7doo7 by selecting the $$$k$$$ tasks that will keep Tinky-Winky busy for the maximum amount of time possible.

Input

The first line contains an integer $$$T$$$ $$$(1\le T\le 100)$$$ representing the number of test cases.

The first line of each test case contains two integers $$$n$$$ and $$$k$$$ $$$(1\le k \le n \le 100)$$$ — the number of all tasks and selected tasks respectively.

The last line of each test case contains $$$n$$$ integers $$$a_1, \ldots, a_n$$$ $$$(1\le a_i\le 1000)$$$ — the elements of array $$$a$$$.

Output

For each test case, output the maximum amount of time that Tinky-Winky will spend on the chosen tasks.

Example
Input
2
5 3
1 5 3 4 2
4 1
7 13 2 5
Output
12
13