local mfl = math.floor

local function comp(a, b)
  return a < b
end

local function lower_bound(ary, x)
  local num = #ary
  if num == 0 then return 1 end
  if not comp(ary[1], x) then return 1 end
  if comp(ary[num], x) then return num + 1 end
  local min, max = 1, num
  while 1 < max - min do
    local mid = mfl((min + max) / 2)
    if comp(ary[mid], x) then
      min = mid
    else
      max = mid
    end
  end
  return max
end

n, k = io.read("*n", "*n")
p = {}
for i = 1, n do
  p[i] = io.read("*n")
end
table.sort(p)

if k == n then print(0) os.exit() end
local l, r = 0, 401

while 1 < r - l do
  local mid = mfl((l + r) / 2)
  local lb = lower_bound(p, mid)
  if k < n - lb + 1 then
    l = mid
  else
    r = mid
  end
end
print(n - lower_bound(p, r) + 1)