#include <iostream>
#include <map>
using namespace std;

map<int, int> prime_factorization(int n) {
    map<int, int> res;
    for (auto i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            res[i]++;
            n /= i;
        }
    }
    if (n != 1) res[n]++;
    return res;
}

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

    auto ans = 0;
    for (auto i = 2; i <= n; i++) {
        if (prime_factorization(i).size() >= k) ans++;
    }
    cout << ans << endl;

    return 0;
}