#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    int i, j, n, k, ans;
    int cnt[2000001] {};
    cin >> n >> k;
    for (i = 2; i <= n; i++) {
        if (cnt[i] == 0) {
            for (j = i; j <= n; j+=i)
                cnt[j]++;
        }
    }
    ans = 0;
    rep (i,n+1) {
        if (cnt[i] >= k)
            ans++;
    }
    cout << ans << endl;
    return 0;
}