#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;
vector<int> furui(2000000 + 1, 0);

int prime_cnt(int n){
  int cnt = 0;

  for (int i=2;i<=sqrt(n);i++) {
    if (n == 1) break;

    if (n % i == 0) {
      while (n % i == 0) {
        n /= i;
      }
      ++cnt;
    }
  }
  if (n != 1) ++cnt;

  return cnt;
}

int main(){
  cin >> N >> K;

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

    if (K <= prime_cnt(i)) {
      for (int j=i;j<=N;j+=i) {
        furui[j] = 1;
        ++cnt;
      }
    }
  }

  cout << cnt << endl;
}