def count_divisors(n):
    divisors = set()
    for i in range(1, int(n**0.5) + 1):
        if n % i == 0:
            divisors.add(i)
            divisors.add(n // i)
    return len(divisors)

N,K = map(int, input().split())
cnt = 0
for i in range(2,N):
    if count_divisors(i) >= K:
        cnt += 1
print(cnt)