import math

n, k = [int(x) for x in input().split()]

prime = [2 * n] * (n + 2)
prime[0] = 2
prime[1] = 3
idx_p = 2
for num in range(6, n + 1, 6):
    for snum in (num - 1, num + 1):
        is_prime = True
        sq = math.sqrt(snum)
        for p in prime:
            if snum % p == 0:
                is_prime = False
                break
            if p > sq:
                break
        if is_prime:
            prime[idx_p] = snum
            idx_p += 1

cnt = [0] * (n + 1)
for p in prime:
    if p > n:
        break
    for i in range(p, n + 1, p):
        cnt[i] += 1
res = 0
for c in cnt:
    if c >= k:
        res += 1

print(res)