The k-th Smallest Integer

Problem Description

Given $n$ positive integers, find the $k$-th smallest integer among them. Integers of the same value are counted only once.

Input Format

The first line contains $n$ and $k$. Starting from the second line, there are $n$ positive integers, separated by spaces.

Output Format

Output the value of the $k$-th smallest integer. If no such value exists, output NO RESULT.

Sample Input

10 3
1 3 3 7 2 5 1 2 4 6

Sample Output

3

Constraints

$n \leq 10000$, $k \leq 1000$. All positive integers are less than $30000$.