#include "bits/stdc++.h"

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

using LL = long long int;
using LD = long double;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; }

bool solve(LL n, LL k) {
	int cnt = 0;

	vb primeFactor(n + 1);

	for (LL i = 2; i * i <= n; i++) {
		while (n % i == 0) {
			if (!primeFactor[i]) {
				cnt++;
				primeFactor[i] = true;
			}

			n /= i;
		}
	}

	if (n > 1 && !primeFactor[n]) {
		cnt++;
	}

	return (cnt >= k ? true : false);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	LL n, k;
	cin >> n >> k;

	int ans = 0;
	for (int i = 2; i <= n; i++) {
		if (solve(i, k)) {
			ans++;
		}
	}
	
	cout << ans << endl;
	return 0;
}