#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
int prime[(int)1e6];
int pnum;

void makePrime(int N){
	int i,k;
	for(i=2;i <= N;++i){
		for(k=0;k<pnum; ++k){
			if(i%prime[k] == 0){
				break;
			}
		}
		if( k == pnum){
			prime[pnum] = i;
			++pnum;
		}
	}
	return;
}

int huru[1+2*(int)1e6];
void makePrime2(int N){
	for(int i=2; i<=N;++i){
		if(huru[i] == 0){
			for(int k=2;i*k<=N;++k){
				huru[i*k] = 1;
			}
			prime[pnum] = i;
			++pnum;
		}
	}

}

int inPrime(int N,int k){
	int ans = 0;
	int tempN = N;

	if(huru[N] == 0){
		return 1;
	}

	for(int i=0;i<pnum && prime[i]<=tempN ;++i){

		if(tempN%prime[i] == 0){
			++ans;
			while(tempN%prime[i] == 0){
				tempN /= prime[i];
			}
			if(ans >= k){
				return k;
			}
			else if(tempN == 1){
				return ans;
			}
			else if(huru[tempN]==0){
				++ans;
				return ans;
			}
		}
	}
	return ans;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
    
	int N,K;
	cin>>N>>K;
	//makePrime(N);
	makePrime2(N);
	
	int ans=0;
	for(int i=2;i<=N;++i){
		if( inPrime(i,K) >= K){
			++ans;
		}
	}
	P(ans);
    return 0;
}