def count_prime_factors(n):
    prime_factors = set()
    if n < 2:
        return 0
    while n >= 2 and n % 2 == 0:
        prime_factors.add(2)
        n //= 2
    i = 3
    while i * i <= n:
        if n % i == 0:
            prime_factors.add(i)
            n //= i
        else:
            i += 2
    if n > 1:
        prime_factors.add(n)
    return len(prime_factors)

N,K = map(int, input().split())
cnt = 0
for i in range(2,N):
    if count_prime_factors(i) >= K:
        cnt += 1
print(cnt)