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

typedef long long ll;
using namespace std;

#define mod 1000000009
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 101

const int MAX_P = 2000000;
bool prime[MAX_P+1];
void primen(void){
    for(int i=2;i<=MAX_P;i++)
        prime[i]=true;
    
    for(int i=2;i*i<=MAX_P;i++)
        if(prime[i])
            for(int j=i;i*j<=MAX_P;j++)
                prime[i*j]=false;
    
}

int n,k,num[2000001]={0},ans=0;

int main(){
    
    scanf("%d%d",&n,&k);
    
    primen();
    
    for(int i=2;i<=n;i++){
        if(prime[i]){
            for(int j=i;j<=n;j+=i){
                num[j]++;
            }
        }
    }
    
    for(int i=2;i<=n;i++){
        if(num[i]>=k){
            ans++;
        }
    }
    
    printf("%d\n",ans);
    
    return 0;
}