n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort(reverse = True)

z = 0
i = 0
now = 400
sw = True
while sw:
    z_now = 0
    while i < n and now == p[i]:
        z_now += 1
        i += 1
    
    if z + z_now == k:
        print(k)
        sw = False
    elif z + z_now > k:
        print(z)
        sw = False
    elif z + z_now < k:
        z += z_now
        now -= 1