def pivot(A):
    return A[len(A)//2]

def quick(A,k):
    piv = pivot(A)
    L = [x for x in A if x < piv]
    E = [x for x in A if x == piv]
    G = [x for x in A if x > piv]
    if(k < len(L)):
        return quick(L,k)
    elif k < len(L) + len(E):
        return E[0]
    else:
        return quick(G,k-len(L)-len(E))

f = open("sdo.in")
g = open("sdo.out","w")
aux = f.readline().split()
n = int(aux[0])
k = int(aux[1])-1
v = []
aux = f.readline().split()
for i in range(n):
    v.append(int(aux[i]))

g.write(str(quick(v,k)))