# Achieving the Threshold

In a classroom of $N$ learners, an assessment was conducted. Each learner, denoted as the $i^{th}$ learner, achieved $A_i$ points. It is noted that each learner's score was **unique**.

A learner is considered to have passed the assessment if their score is **strictly above** the pass mark.

Given that precisely $X$ learners managed to pass, determine the **highest possible** pass mark for this assessment.

## Input format

- The initial line includes a single integer $T$, representing the count of scenarios to consider.
- Following this, each scenario is described over several lines.
- The first line for every scenario lists two integers separated by a space, $N$ and $X$ — the total number of learners and the count of learners who passed.
- The subsequent line lists $N$ integers separated by spaces, $A_1, A_2, \ldots, A_N$, with the $i^{th}$ integer indicating the score of the $i^{th}$ learner.

## Output format

For each scenario, report on a new line the **highest** possible pass mark for the assessment.

## Limitations

- $1 \leq T \leq 100$
- $1 \leq N \leq 100$
- $1 \leq X \leq N$
- $1 \leq A_i \leq 100$
- All $A$ array elements are
**unique**.

## Sample Scenarios (with explanations)

### Scenario #1:

Input:

`3 2 2 5 1 4 1 5 1 7 4 4 3 15 70 100 31`

Output:

`0 6 30`

#### Clarification

**Scenario $1$:** As all learners have surpassed the pass mark, each learner's score is above the pass mark. The pass mark's maximum feasible value is $0$, since all learners have scores above $0$.

**Scenario $2$:** Just one learner has surpassed the test. Therefore, the third learner managed to pass by achieving $7$ points. The assessment's pass mark is $6$.

**Scenario $3$:** Given that three learners have passed, learners $2, 3,$ and $4$ have scores above the pass mark. The highest possible pass mark is $30$, with three learners scoring above $30$.