let number_of_primefactors n =
  let max_prime = n / 2 in
  let rec div n d =
    if n mod d = 0 then div (n/d) d
    else n
  in
  let div2 = div n 2 in
  let rec loop n i count =
    if i <= max_prime then
      if n mod i = 0 then loop (div n i) (i+2) (count+1)
      else loop n (i+2) count
    else count
  in
  if n mod 2 = 0 then loop div2 3 1
  else loop n 3 0

let main n k =
  let rec loop i count =
    if i > n then count else
      if number_of_primefactors i >= k then loop (i+1) (count+1)
      else loop (i+1) count
  in
  loop 2 0

let () = print_int @@ Scanf.sscanf (read_line ()) "%d %d" main;
	 print_endline "\n"