N, K = map(int, raw_input().split()) sieve = [0] * (N + 1) for i in xrange(2, N + 1): if sieve[i] > 0: continue j = i while j <= N: sieve[j] += 1 j += i count = sum(sieve[i] >= K for i in xrange(2, N + 1)) print count