#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int a[2000010];

int main()
{
	int n, k;
	cin >> n >> k;

	for (int i = 2; i <= n; i++){
		if (!a[i]) {
			for (int j = i; j <= n; j += i)
				a[j]++;
		}
	}
	
	ll ans = 0;
	for (int i = 2; i <= n; i++) {
		if (a[i] >= k)
			ans++;
	}
	cout << ans << endl;
	return 0;
}