#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
	int n, k;
	cin >> n >> k;
	static const int MAX_N = 2000000;
	static bool isPrime[MAX_N + 1];
	fill(&isPrime[0], &isPrime[MAX_N] + 1, true);
	isPrime[0] = false;
	isPrime[1] = false;
	for (int i = 2; i <= n; ++i) {
		if (isPrime[i]) {
			for (int k = i * 2; k <= n; k += i) {
				isPrime[k] = false;
			}
		}
	}
	vector<int> primes;
	for (int i = 0; i <= n; ++i) {
		if (isPrime[i]) {
			primes.push_back(i);
		}
	}
	static bool hasManyFactors[MAX_N + 1] = { false };
	for (int x = 2; x <= n; ++x) {
		int remaining = x;
		int factorCount = 0;
		for (size_t i = 0; primes[i] * primes[i] <= remaining; ++i) {
			bool isFactor = false;
			while (remaining % primes[i] == 0) {
				remaining /= primes[i];
				isFactor = true;
			}
			if (isFactor) {
				++factorCount;
			}
		}
		if (remaining > 1) {
			++factorCount;
		}
		if (factorCount >= k) {
			hasManyFactors[x] = true;
		}
	}
	int result = count(&hasManyFactors[0], &hasManyFactors[n] + 1, true);
	cout << result << endl;
	return 0;
}