import math
N, K = map(int, input().split()) 

def SoE(x):
    if x < 2:
        return []
    
    l = [i for i in range(x + 1)]
    l[1] = 0
    
    for i in l:
        if i > math.sqrt(x):
            break
        if i == 0:
            continue
        for j in range(2 * i , x + 1, i):
            l[j] = 0
    
    return [i for i in l if i != 0]

prime_l = SoE(N)

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

for li in prime_l:
    ck = li
    while ck <= N:
        l[ck] += 1
        ck += li

l.sort()
l.reverse()

count = 0

for li in l:
    if li > K:
        count += 1
    else:
        break

print(count)