a = input().split(' ')
b = int(a[0])
c = int(a[1])
d = input().split(' ')
e = [0] * b
for k in range(0, len(d)):
    e[k] = int(d[k])


def quiksort(low, high):
    global e
    global c
    pivot = e[low]
    while low < high:
        while low < high and e[high] >= pivot:
            high -= 1
        e[low] = e[high]
        while low < high and e[low] <= pivot:
            low += 1
        e[high] = e[low]
    e[low] = pivot
    return low


start = 0
end = b
temp = quiksort(start, end-1)
while True:
    if temp == c:
        print(e[temp])
        break
    elif temp > c:
        start = start
        end = temp-1
        temp = quiksort(start, temp)
    else:
        start = temp+1
        end = end
        temp = quiksort(start, end)