def solve(N, K):
    primes = [2, 3, 5, 7, 11, 13, 17, 19]
    if K > len(primes):
        return 0
    pp = 1
    for p in primes[:K]:
        pp *= p
    if pp > N:
        return 0
    ps = [0] * (N + 1)
    for i in range(2, (N + 4)//2):
        if ps[i]:
            continue
        for j in range(i, N + 1, i):
            ps[j] += 1

    count = 0
    for pi in ps[2:]:
        if pi >= K:
            count += 1
    return count

N, K = map(int, input().split())
print(solve(N, K))