from collections import Counter


n, k = map(int, input().split())
p = list(map(int, input().split()))
c = Counter(p).most_common()
c.sort(key=lambda x:x[0], reverse=True)
cur = 0
for key, v in c:
    if cur + v > k:
        print(cur)
        break
    cur += v
else:
    print(k)