#include <iostream>
#include <algorithm>
#include <vector>

void solve() {
    int n, k;
    std::cin >> n >> k;

    std::vector<int> cnt(n + 1, 0);
    for (int p = 2; p <= n; ++p) {
        if (cnt[p] > 0) continue;

        for (int q = p; q <= n; q += p) ++cnt[q];
    }

    std::cout << std::count_if(cnt.begin(), cnt.end(),
                               [&](int x) { return x >= k; })
              << std::endl;
}

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

    solve();

    return 0;
}