#include <bits/stdc++.h>

using namespace std;

#define REP(i,first,last) for (int i=first;i<last;i++)
#define MAX(x,y) (x > y ? x : y)
#define MIN(x,y) (x < y ? x : y)

int N, K;

int main(){
  cin >> N >> K;
  vector<int> furui(N + 1, 0);

  for (int i=2;i<=N;++i) {
    if (0 < furui[i]) continue;

    for (int j=i;j<=N;j+=i) {
      ++furui[j];
    }
  }

  int cnt = 0;
  for (int i=2;i<=N;++i) {
    if (K <= furui[i]) ++cnt;
  }

  cout << cnt << endl;
}