# 完全全探索でO(N x max(pi))
# あえてcnt部をbisect
# さらにあえてBも二部探索(境界条件がややテクニカル)

from bisect import *

N, K = map(int, input().split())
P = list(map(int, input().split()))
P.sort()

ok = 401
ng = -1
while ok - ng > 1:
    m = (ok + ng) // 2
    cnt = N - bisect_left(P,m)
    if cnt <= K:
        ok = m
    else:
        ng = m

ans = N - bisect_left(P,ok)
print(ans)