#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define SQR(X) ((X)*(X))

typedef long long ll;
typedef unsigned long long ull;
typedef long double lb;
/* ここからが本編 */

static int arr[2000005];
static int prime[200000];
void Eratosthenes(int N){
   for(int i = 0; i < N; i++){
      arr[i] = 1;
   }
   for(int i = 2; i < sqrt((double)N); i++){
      if(arr[i]){
         for(int j = 0; i * (j + 2) < N; j++){
            arr[i *(j + 2)] = 0;
         }
      }
   }
   int a = 0;
   for(int i = 2; i < N; i++){
      if(arr[i]){
         prime[a++] = i;
      }
   }
}

int main(void)
{
   ull i=1,j,k;
   int n;
   int c;
   int m;
   int rep = 0;
   Eratosthenes(2000003);
   cin >> n;
   cin >> c;
   for(i=2;i<=n;i++) {
      int cnt = 0;
      int m = i;
      for(j=0;SQR(prime[j]) <= m;j++)
      {
         if(m % prime[j] == 0){
            cnt++;
            while(m % prime[j] == 0){
               m /= prime[j];
            }
         }
      }
      if(m != 1) cnt++;
      if(cnt >= c) rep++;
   }
   cout << rep << endl;
   return 0;
}