There are N integers A1...An. Hong wants to know the kth smallest integer of them.
However, Hong is not good at maths. He asks you to find the kth smallest integer.
There are N integers A1...An. Hong wants to know the kth smallest integer of them.
However, Hong is not good at maths. He asks you to find the kth smallest integer.
The first line will be an integer T (1≤T≤5), which is the number of test cases.
For each test data:
The first line contains two integer N and k(1≤k<N≤10^6).
The next line contains N integers Ai(1≤Ai≤10^9).
1
3 2
1 2 3
2