#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-12;

vector<int> sieve(int n) {
	vector<int> res;
	vector<bool> is_prime(n + 1, true);
	
	is_prime[0] = is_prime[1] = false;
	
	for (int i = 2; i * i <= n; i++) if (is_prime[i]) {
		res.push_back(i);
		is_prime[i] = false;
		for (int j = 2; i * j <= n; j++) if (is_prime[i * j]) {
			is_prime[i * j] = false;
		}
	}
	
	REP(i, n + 1) if (is_prime[i]) res.push_back(i);
	sort(res.begin(), res.end());
	return res;
}

int N, K;
int cnt[2000001];

int main() {
	cin >> N >> K;
	
	vector<int> prime = sieve(N);
	
	REP(i, prime.size()) {
		cnt[ prime[i] ] = 1;
		
		FOR(j, 1, N + 1) {
			if (j * prime[i] > N) break;
			if (cnt[j] == 0) continue;
			
			if (j % prime[i] == 0) cnt[j * prime[i] ] = cnt[j];
			else cnt[ j * prime[i] ] = cnt[j] + 1;
		}
	}
	
	int ans = 0;
	FOR(i, 2, N + 1) if (cnt[i] >= K) ans++;
	
	cout << ans << endl;
	
	return 0;
}