#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    int n, k, ans1 = 0;
    cin >> n >> k;
    vector<int> prime(n + 1, 1), ans(n+1);
    prime[0] = 0;
    prime[1] = 0;
    for (int i = 2; i <= pow(n, 0.5); i++){
        for (int j = i*i; j <= n; j += i) prime[j] = 0;
    }
    for (int i = 2; i <= n; i++){
        if (prime[i]){
            for (int j = i; j <=n; j += i) ans[j]++;
        }
    }
    for (int i = 2; i <= n; i++){
        if (ans[i] >= k) ans1++;
    }
    cout << ans1 << endl;
}