The council of the boar woods of Tuskmore pays by the answer, and Quin intends to earn it. First: the full register of weights. Task: Print the k-th smallest element (1-based; duplicates count separately). Input format: First line: n and k. Second line: n integers. Output format: Print the k-th smallest value. Constraints: 1 <= k <= n <= 5216; -1000000 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 5216; -1000000 <= a[i] <= 1000000.
