#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>

static const int MOD = 1000000007;
using ll = int64_t;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> v(n+1, 0);
    for (int i = 2; i <= n; ++i) {
        if(v[i] >= 1) continue;
        for (int j = i; j <= n; j += i) {
            v[j]++;
        }
    }
    int ans = 0;
    for (int i = 2; i <= n; ++i) {
        if(v[i] >= k) ans++;
    }
    cout << ans << "\n";
    return 0;
}