#include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
const int MAX = 2.1e6;
int dp[MAX];
signed main(){
  int n,k;
  cin>>n>>k;
  memset(dp,0,sizeof(dp));
  for(int i=2;i<MAX;i++)
    if(!dp[i]) for(int j=i;j<MAX;j+=i) dp[j]++;

  int ans=0;
  for(int i=2;i<=n;i++) ans+=dp[i]>=k;
  cout<<ans<<endl;
  return 0;
}