n,K=map(int,input().split())

sosu=[i for i in range(n+1) ]

for i in range(4,n+1,2):
    sosu[i]=0

for j in range(3,int(n**0.5)+1,2):
    for k in range(j,n//j+1,2):
        sosu[j*k]=0
sosu=sorted(list(set(sosu)))

num=[0]*(n+1)

for i in range(2,len(sosu)):
    for j in range(1,10**6+1):
        if sosu[i] * j > n:
            break
        num[sosu[i] * j] += 1

ans=0
for i in num:
    if i >= K:
        ans+=1

print(ans)