Description

Given n positive integers, where n ≤ 10,000, find the k-th smallest integer among them (counting each unique integer only once). Here, k ≤ 1,000, and all integers are less than 30,000.

Input Format

The first line contains two integers, n and k. The second line contains n positive integers separated by spaces.

Output Format

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

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

3

## Source

CodesOnline