N, K = map(int, input().split(" "))

primes = [2]
search = [i for i in range(3,N,2)]
while search[0]*search[0] < N:
    primes.append(search[0])
    _search = [i for i in search[1:] if i % search[0] != 0]
    search = _search
[primes.append(i) for i in search]

all_num = [0 for i in range(1,N+1)]


for i in primes:
    cur = i
    while cur <= N:
        all_num[cur-1] += 1
        cur += i
count = 0
for i in all_num:
    if i >= K:
        count += 1

print(count)