import math

N = 2*10**6+50
spf = [-1]*(N+1)
for i in range(N+1):
    spf[i] = i
for i in range(2, int(math.sqrt(N))+1):
    if spf[i] == i:
        for j in range(i*2, N+1, i):
            if spf[j] == j:
                spf[j] = i

n, k = map(int, input().split())
ans = 0
for i in range(1, n+1):
    cnt = 0
    while i != 1:
        p = spf[i]
        cnt += 1
        while i%p == 0:
            i //= p
    if cnt >= k:
        ans += 1
print(ans)