#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
  #include "settings/debug.cpp"
  #define _GLIBCXX_DEBUG
#else
  #define Debug(...) void(0)
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  int n, k;
  cin >> n >> k;
  vector<bool> isPrime(n + 1, true);
  vector<int> cnt(n + 1, 0);
  isPrime[0] = isPrime[1] = false;
  for (int i = 2; i <= n; i++) {
    if (isPrime[i]) {
      for (int j = i; j <= n; j += i) {
        isPrime[j] = false;
        cnt[j]++;
      }
    }
  }
  int ans = 0;
  for (int i = 2; i <= n; i++)
    if (cnt[i] >= k) ans++;
  cout << ans << endl;
  return 0;
}