In a bustling ice cream parlor, customers line up to order their favorite flavors. The shop owner has a peculiar way of managing the queue. Instead of serving customers in their arrival order, the owner wants to serve them based on their heights, from the shortest to the tallest. However, the shop owner had a bad day, only want to serve the person who would be the $k^{th}$ person in line if everyone was arranged by height.
Given the heights of $N$ customers, help the shop owner find out who would be the $k^{th}$ (0-based) person if they were arranged from shortest to tallest.
Input contains two lines. The first line contains two integers $N$ and $k$, the number of people in the queue and the position the shop owner want to find.
The second line contains $N$ integer, where each integer $h_i$ represent the height of the $i^{th}$ customer.
Output the height of the $k^{th}$ (0-based) customer when they are arranged from shortest to tallest.
Noted that you should output one single line.