def primes(n):
    ans = set()
    while n %2 == 0:
        ans.add(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n %f == 0:
            ans.add(f)
            n //= f
        else:
            f += 2
    if n != 1:
        ans.add(n)
        
    return ans

n, k = map(int, input().split())
cnt = 0
for i in range(2, n+1):
    a = len(primes(i))
    if a >= k:
        cnt += 1
print(cnt)