n, k = map(int, input().split())
q = list(map(int, input().split()))

def quick_sort(q, l, r, k):
    if l == r:
        return q[l]
    
    i = l - 1
    j = r + 1
    x = q[(l + r) // 2]
    while i < j:
        i += 1
        j -= 1
        while q[i] < x: i += 1
        while q[j] > x: j -= 1
        if i < j:
            q[i], q[j] = q[j], q[i]
    sl = j - l + 1
    if sl >= k:
        return quick_sort(q, l, j, k)
    else:
        return quick_sort(q, j + 1, r, k - sl)
    
print(quick_sort(q, 0, n - 1, k + 1))