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

if K > 7:
    print(0)

P = [2, 3, 5, 7, 11, 13]

n = N

for i in range(K - 1):
    n //= P[i]
    
isPrime = [0] + [1] * n

for i in range(2, int(n ** 0.5) + 1):
    if isPrime[i]:
        for j in range(2 * i, n + 1, i):
            isPrime[j] = 0

Prime = [i for i in range(2, n + 1) if isPrime[i]]

ans = 0
n //= P[K - 1]
X = []
for p in Prime:
    x = [p]
    while x[-1] <= n:
        x += [x[-1] * p]
    X += [x]
from itertools import product, combinations
while True:
    z = 0
    for pro in combinations(X, r=K):
        for i in product(*pro):
            y = 1
            for j in i:
                y *= j
            if y <= N:
                z += 1
    if z:
        ans += z
        K += 1
    else:
        break
print(ans)