#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int m = 2000000;
int cnt[m + 1];
bool is_prime[m + 1];

void init() {
  for (int i = 2; i <= m; i++) is_prime[i] = true;
  for (int i = 2; i <= m; i++) {
    if (!is_prime[i]) continue;
    cnt[i]++;
    for (int j = i + i; j <= m; j += i) {
      is_prime[j] = false;
      cnt[j]++;
    }
  }
}

int main() {
  init();
  int n, k;
  cin >> n >> k;
  int res = 0;
  for (int i = 2; i <= n; i++) {
    if (cnt[i] >= k) res++;
  }
  
  cout << res << endl;

  return 0;
}