#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> prime_factorize(int n) {
    vector<pair<int, int>> ret;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            int num = 0;
            while (n % i == 0) {
                num++;
                n /= i;
            }
            ret.push_back({i, num});
        }
    }
    if (n != 1)
        ret.push_back({n, 1});
    return ret;
}

int main() {
    int N, K;
    cin >> N >> K;

    int ans = 0;
    for (int i = 2; i <= N; i++) {
        auto V = prime_factorize(i);
        if ((int)V.size() >= K) {
            ans++;
        }
    }
    cout << ans << endl;
}