from math import *


def Sieve(n):
    lst = [True] * (n + 1)
    S = set()
    for i in range(2, ceil(sqrt(n)) + 1):
        if lst[i]:
            for j in range(2 * i, n + 1, i):
                lst[j] = False
    for i in range(2, n + 1):
        if lst[i]:
            S.add(i)
    return S

N, K = map(int, input().split())
D = [0] * (N + 1)
S = Sieve(10 ** 6 + 5)
for i in S:
    for j in range(i, N + 1, i):
        D[j] += 1
ans = 0
for i in range(N + 1):
    if D[i] >= K:
        ans += 1
print(ans)