#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef pair<int, int> PI;
const double EPS=1e-9;

const int N = 2001000;
int dp[N];

int main(void){
  int n,k;
  cin >> n >> k;  
  REP (i, 2, N) {
    if (dp[i]) {
      continue;
    }
    for (int j = i; j < N; j += i) {
      dp[j]++;
    }
  }
  int cnt = 0;
  REP(i, 2, n + 1) {
    cnt += dp[i] >= k;
  }
  cout << cnt << endl;
}