play
Source: hackerearth
Difficulty: MEDIUM

There was a game organised in the college for recreation.
     The condition was that there were N number of locks in a room .
     With each lock there was a sealed box which contained keys.
     THe competitor had to push a lever in the box then a key would pop up.
     Then he had to try the key in the lock, if the lock could not open 
     then throw away the key.
     Also there was a number Ai written on the paper kept beside the box which told 
     how many try will it take to open the lock.

Initially Everybody was allowed to see the setups and all the locks. 
     So every competitor noted the number which was written on the note
     so that they know how many times they had to try.
     But before the start of the game the organisers interchanged the locks
     with their boxes , to make the note useless as the setup was  shuffled.
     The competitor were asked to open K number of locks.
     A competitor wanted to find out the worst case , as in the most number 
     try he had to make to open K locks.
     So it's your duty to provide him with a program to find out the worst case.

The first line contains an integer T, the number of test cases. 
        Then T test cases follow.The first line for each test case has 
        2 integers N and K. Then next line has N integers A1, A2, ..., AN.

For each test case, print the minimal number of try for the worst-case.

SAMPLE INPUT
1
2 1
5 8

SAMPLE OUTPUT
8