K-th smallest number

You are given $N$ numbers $A_1, A_2, \dots, A_N$. Sort them in ascending order and print the number that ends up at position $K$, counting from the front.

If a value appears several times, every occurrence counts as a separate element.

The first line contains $N$ and $K$. ($1 \le N \le 5 \times 10^6$, $1 \le K \le N$)

The second line contains $A_1, A_2, \dots, A_N$, separated by spaces. ($-10^9 \le A_i \le 10^9$)

Print, on one line, the $K$-th number from the front after $A$ is sorted in ascending order.