N,K=map(int,raw_input().split())
isPrime=[0 for i in xrange(N+1)]
ans=0
if K==1:
    print N-1
    exit()
for i in xrange(2,N+1):
    if isPrime[i]==0:
        for j in xrange(i+i,N+1,i):
            isPrime[j]+=1
            if isPrime[j]==K:
                ans+=1
print ans