import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines import numpy as np N,K = map(int,read().split()) def make_prime(U): is_prime = np.zeros(U,np.bool_) is_prime[2] = 1 is_prime[3::2] = 1 M = int(U**.5)+1 for p in range(3,M,2): if is_prime[p]: is_prime[p*p::p+p] = 0 return is_prime, is_prime.nonzero()[0] U = 2 * 10 ** 6 + 10 _,primes = make_prime(U) cnt = np.zeros(U,np.int32) for p in primes: cnt[p::p] += 1 x = cnt[2:N+1] answer = np.count_nonzero(x >= K) print(answer)