//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//g++ yarudake.cpp -std=c++17 -I .
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
class smart_sieve
{
    ll L, R, M;
    vector<int> small;        // 小さい篩
    vector<vector<ll>> large; // 大きい篩
    vector<ll> aux;           // aux[i] := large[i] の素因数の積

public:
    smart_sieve(ll L, ll R) : L(L), R(R), M(sqrt(R) + 1)
    {
        small.resize(M);
        iota(small.begin(), small.end(), 0);
        large.resize(R - L);
        aux.assign(R - L, 1);

        for (ll i = 2; i * i < R; ++i)
        {
            if (small[i] < i)
                continue;
            small[i] = i;
            for (ll j = i * i; j < M; j += i)
                if (small[j] == j)
                    small[j] = i;

            for (ll j = (L + i - 1) / i * i; j < R; j += i)
            {
                ll k = j;
                do
                {
                    // aux[j-L] > M で判定した方がいいかも？
                    // j / aux[j-L] < M の方がいい？（割り算したくない）
                    if (aux[j - L] * aux[j - L] > R)
                        break;

                    large[j - L].push_back(i);
                    aux[j - L] *= i;
                    k /= i;
                } while (k % i == 0);
            }
        }
    }

    vector<ll> factor(ll n)
    {
        assert(L <= n && n < R);
        vector<ll> res = large[n - L];
        n /= aux[n - L];
        if (n >= M)
        {
            // この場合，n は素数となることが示せる（はず）
            // n*n >= R だとオーバーフローしそう？
            res.push_back(n);
            return res;
        }
        while (n > 1)
        {
            res.push_back(small[n]);
            n /= small[n];
        }
        return res;
    }
};

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,k;
    cin>>n>>k;
    int ans=0;
    smart_sieve ss(1, n+1);
    for(ll i=1;i<=n;i++){
        vector<ll> f = ss.factor(i);
        set<ll> s;
        rep(j,f.size()){
            s.insert(f[j]);
        }
        if(s.size()>=k)ans++;
    }
    cout<<ans<<"\n";
}