Kejriwal And Broom

Once Kejriwal went to a sale of old brooms. There were ‘n’ brooms at that sale. Broom with index ‘i’ costs  ‘ai’ . Some brooms are so useless that they have a negative price ie. their owners are ready to pay Kejriwal if he buys those brooms. Kejriwal can buy any broom(s) he wants. Though he's very strong but  can carry at most ‘m’ brooms only, and he has no desire to go to the sale for the second time. Please, help Kejriwal find out the maximum sum of money that he can earn.

Input

The first line contains ‘t’-number of test cases.Each test case contains two space-separated integers ‘n’ and ‘m’ — amount of brooms at the sale, and amount of brooms that Kejriwal can carry and the following line contains ‘n’ space-separated integers ‘ai’ — prices of the brooms

Output

Output the only number — the maximum sum of money that Kejriwal can earn, given that he can carry at most ‘m’ brooms.

Constraints

1. 1<=t<=100

2. 1<=m<=n<=100

3. -1000<=ai<=1000

Sample Input

2

5 3

-6 0 35 -2 4

4 2

7 0 0 -7

Sample Output

8

7