#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int cnt[2000001];
bool f[2000001];
int main(){

	fill_n(f, 2000001, true);
	f[0] = f[1] = false;
	for (int i = 2; i <= 2000000; i++){
		if (!f[i])continue;
		cnt[i]++;
		for (int j = i + i; j <= 2000000; j += i){
			cnt[j]++;
			f[j] = false;
		}
	}

	int N, K;
	cin >> N >> K;
	int ans = 0;
	for (int i = 2; i <= N; i++){
		if (cnt[i] >= K)ans++;
	}
	cout << ans << endl;
	return 0;

}