#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    int N,K;
    cin >> N >> K;
    
    vector<int> P(N+1,0);
    
    for ( int i = 2; i <= N; i++ ) {        
        if ( P[i] == 0 ) {
            for ( int j = i; j <= N; j += i ) {
                P[j]++;
            }
        }        
    }
    int ans = 0;
    for ( int i = 2; i <= N; i++ ) {
        if ( P[i] >= K ) { ans++; }
    }
    
    cout << ans << endl;
    
    return 0;
}