#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = 1000000007;

// 素因数分解
int pdecomp(unsigned int n){
    int res = 0;
    unsigned int e = 0; while(n % 2 == 0){ n /= 2, e++; }
    if(e) res++;
    for(unsigned int p = 3; p*p <= n; p += 2){
        unsigned int e = 0; while(n % p == 0){ n /= p, e++; }
        if(e) res++;
    }
    if(n != 1) res++;
    return res;
}

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

    int res = 0;
    for(int i = 2; i <= N; i++){
        if(pdecomp(i) >= K) res++;
    }

    cout << res << endl;
    return 0;
}