#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int cache[200100];

int calc(int n) {
    map<int,bool> dic;
    int i = 2;
    while (n > 1) {
        while (n % i == 0) {
            dic[i] = true;
            n /= i;
        }
        i++;
    }
    out("%d: %d\n", n, dic.size());
    return dic.size();
}

signed main()
{
    int n, k;
    cin >> n >> k;
    int cnt = 0;
    FOR(i,2,n+1) {
        if (k <= calc(i)) cnt++;
    }
    cout << cnt << endl;

    return 0;
}