import bisect
N, K = map(int, input().split())
P = list(map(int, input().split()))
P.sort()
l = -1
r = 401
ans = 0
while r-l>1:
    mid = (l+r)//2
    pos = bisect.bisect_left(P, mid)
    if N-pos<=K:
        r = mid
        ans = max(ans, N-pos)
    else:
        l = mid
print(ans)