#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int MAX_N = 2*(int)1e6 + 5;

bool p[MAX_N];
int cnt[MAX_N];

void disp(void ){
	rep (i, 100 )
		cerr << setw(2) << i;
	cerr << endl;
	rep (i, 100 )
		cerr << setw(2) << cnt[i];
	cerr << endl;
}

void sieve (void ){
	memset (cnt, 0, sizeof (cnt ) );
	fill (p, p+MAX_N, true );
	p[0] = false;
	p[1] = false;

	for (int i = 2; i < MAX_N; i++ ){
		if (p[i] )
			for (int j = 2*i; j < MAX_N; j+= i ){
				cnt[j]++, p[j] = false;
			} // end for
	} // end for
}

int main()
{
	sieve();
	disp();
	ios_base::sync_with_stdio(0);
	int N, K; cin >> N >> K;
	
	int res = 0;
	for (int i = 2; i <= N; i++ ){
		if (cnt[i] >= K || (K == 1 && p[i] ) ) res++;
	} // end for

	cout << res << endl;

	return 0;
}