#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

//	vector
template<typename T>
vector<T> trialDivision(T a) {
	vector<T> res;
	T i = 2;
	while (i * i <= a) {
		if (a % i == 0) {
			a /= i;
			res.push_back(i);
		}
		else ++i;
	}
	if (a != 1) res.push_back(a);
	return res;
}

int main() {
	int N, K;
	cin >> N >> K;
	int ans = 0;
	for (int i = 2; i <= N; ++i) {
		vector<int> tmp = trialDivision(i);
		tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
		if (K <= tmp.size()) ++ans;
	}
	cout << ans;
}