#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

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

    vector<bool> is_prime(N+1, true);
    vector<int> cnt_factor(N+1, 0);
    is_prime[0] = is_prime[1] = false;

    for(int i=2; i<=N; ++i){
        if(!is_prime[i]) continue;
        cnt_factor[i]++;
        for(int j=i+i; j<=N; j+=i){
            is_prime[j] = false;
            cnt_factor[j]++;
        }
    }

    int ans = 0;
    for(int i=2; i<=N; ++i){
        if(cnt_factor[i] >= K){
            ans++;
        }
    }
    cout << ans <<endl;

    return 0;
}