import math

def count_primes(i, K):
    global primes
    global memo
    count = 0
    for j in primes:
        if i < j:
            break
        if i % j == 0:
            count += 1
            if count >= K:
                break
        while i % j == 0:
            i //= j
            if memo.get(i, False):
                return True
    return count >= K

n = int(math.sqrt(2000000))+1
primes = [2]
for i in range(3,n,2):
    for j in primes:
        if i % j == 0:
            break
        if j*2 > i:
            primes.append(i)
            break

N, K = map(int, input().split(" "))
total = 0
memo = {}
for i in range(2, N+1):
    if count_primes(i, K):
        total += 1
        memo[i] = True
print(total)