#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);++i)
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)
#define mp make_pair
#define pb push_back
#define fi first
#define sc second

const int N=2000000;

int main(int argc, char const *argv[]) {
  bool prime[N+1];
  rep(i,N+1) prime[i]=true;
  prime[0]=prime[1]=false;
  for(int i=2; i<=N; ++i){
    if(prime[i])
      for(int j=2; i*j<=N; ++j) prime[i*j]=false;
  }

  vector<int> p;
  rep(i,N+1) if(prime[i]) p.pb(i);

  int n,k;
  cin >>n >>k;

  int ans=0;
  for(int i=2; i<=n; ++i){
    int ct=0;
    int t=i;

    rep(j,p.size()){
      if(j*j>i) break;
      if(i%p[j]==0) ++ct;
    }

    if(ct>=k) ++ans;
  }

  std::cout << ans << std::endl;
  return 0;
}