#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long int ll;
using namespace std;
const int mod=1e9+7;

int N, K;
vector<int> hurui_v(int n) {
    vector<int> v;
    bool *isPrime_v;
    isPrime_v = new bool[n + 1]; // 処理用のメモリ確保

    // 初期化
    isPrime_v[0] = isPrime_v[1] = false;
    for (int i = 2; i < n + 1; i++) isPrime_v[i] = true;

    // isPrime[0~n]で素数のものだけtrueにする
    for (int i = 2; i*i <= n; i++) {
        for (int j = i * 2; j < n + 1; j += i) {
            isPrime_v[j] = false;
        }
    }

    // 素数のみ追加
    for (int i = 0; i < n + 1; i++) {
        if (isPrime_v[i]) v.push_back(i);
    }

    delete[] isPrime_v; //メモリ解放
    return v;
}

int dp[2000010];
int ans;
int main(){
    cin>>N>>K;
    vector<int> prime = hurui_v(N);
    p(prime.size());
    dp[1]=0;
    REP(i,1,N){
        for(auto p:prime){
            dp[i*p] = max(dp[i*p], dp[i]+(i%p!=0));
        }
    }
    REP(i,2,N+1){
        if(dp[i]>=K) ans++;
    }
    p(ans);
    return 0;
}