You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Given $n$ numbers, what is the strictly $k$-th smallest number among them? The strictly $k$-th smallest number refers to the $k$-th smallest number after removing duplicates.

Input Format

The first line contains two integers $n$ and $k$ ($1≤k≤n≤10^5$).
The second line contains $n$ integers $a$ ($1≤a_i≤10^9$), representing the $n$ numbers.

Output Format

Output a single line containing an integer, representing the answer.
The input guarantees a solution.

Sample

5 3
1 2 3 2 4

3