Supermarket

A supermarket is running a promotion. Throughout the day, each customer spends some amount of money in the store. At the end of the day, the store draws a number $k$ and sends a prize to the customer who spent the $k$-th smallest amount that day (counting the amounts from smallest to largest). The amounts spent by customers need not be distinct, but your task is simply to find the value of the $k$-th smallest amount spent that day.

The first line contains the number of test cases $d$ ($1 \le d \le 100$).

The first line of each test contains the number of customers $n$ who visited the store that day and the number $k$ ($1 \le n \le 10^6$; $1 \le k \le n$). The second line contains $n$ integers denoting the amounts spent by the customers in order. Each amount is an integer between $1$ and $10^5$, inclusive.

For each test, print the value of the $k$-th smallest amount spent that day, one per line.