import numpy as np

def SoE(n):
    if n < 2:
        return
    elif n <= 3:
        return np.arange(2, n+1)
    ret = np.arange(n+1)
    c = int(np.sqrt(n)) + 1
    for i in range(2, c):
        if ret[i] != 0:
            ret[i+i::i] *= 0
    return ret[ret > 1]

N, K = map(int, input().split())
pnl = SoE(N)
nl = np.zeros(N+1)
for pn in pnl:
    nl[pn::pn] += 1
ans = len(nl[nl >= K])
print(ans)