#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> primes(n + 1);
    for (int i = 2; i <= n; i++) {
        if (primes.at(i) != 0) continue;
        for (int j = i; j <= n; j += i) {
            primes.at(j)++;
        }
    }
    auto comp = [&](int x) { return x >= k; };
    cout << count_if(primes.begin(), primes.end(), comp) << endl;
}