def era(n):
    is_prime = [True]*(n+1)
    is_prime[0] = False
    is_prime[1] = False
    
    for i in range(2, int(n**0.5)+1):
        if not is_prime[i]:
            continue
        
        for j in range(2*i, n+1, i):
            is_prime[j] = False
    
    return [i for i in range(n+1) if is_prime[i]]

N, K = map(int, input().split())
cnt = [0]*(1+N)
primes = era(N)

for p in primes:
    for i in range(p, N+1, p):
        cnt[i] += 1

ans = 0

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

print(ans)