n = 10**7
is_prime = [1]*(n + 1)
is_prime[0] = 0  
is_prime[1] = 0
for p in range(2, n + 1):
    if is_prime[p]:
        for q in range(2*p, n + 1, p):
            is_prime[q] = 0

primes = []
for i in range(2, n+1):
    if is_prime[i] == 1:
        primes.append(i)

N, K = map(int, input().split())
factor_count = [0]*(N+1)
for p in primes:
    for m in range(p, N+1, p):
        factor_count[m] += 1

ans = 0
for i in range(2, N+1):
    if factor_count[i] >= K:
        ans += 1
        
print(ans)