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

vector<long> prime_factors(long n) {
  vector<long> ret;
  long i = 2;
  while (i * i <= n) {
    if (n % i)
      i += 1;
    else {
      n /= i;
      ret.push_back(i);
    }
  }
  if (n > 1) ret.push_back(n);
  return ret;
}

int main(void) {
#ifdef DEBUG
  freopen("input.txt", "r", stdin);
#endif

  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  long N; int K;
  cin >> N;
  cin >> K;
  long ans = 0;
  for (long i = 2; i <= N; i++) {
    vector<long> ret;
    ret = prime_factors(i);
    set<long> primes(ret.begin(), ret.end());
    if (primes.size() >= K) ans++;
  }
  cout << ans << endl;
  return 0;
}