#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;


int main(){
	int N,K;
	cin >> N >> K;
	vector<int> v(N+1, 0);
	vector<bool> p(N+1, true);
	for(long long i=2; i*i<=N; ++i){
		if(p[i] == false) continue;
		for(int j=i+i; j<=N; j+=i){
			v[j]++;
			p[j] = false;
		}
	}

	long long ans = 0;
	for(int i=2; i<=N; i++){
		ans += (v[i]+(p[i]?1:0))>=K?1:0;
	}

	cout << ans << endl;
	
	return 0;
}