#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, k;
    cin >> n >> k;

    int ans = 0;

    if(k >= 8){
        cout << ans << endl;
        return 0;
    }

    srep(i,2,n+1){
        int cnt = 0;
        int ii = i;
        srep(j,2,210){
            if(cnt == k - 1 && ii > 1){
                ans++;
                break;
            }
            if(ii == 1)break;
            if(ii % j == 0)cnt++;
            while(ii % j == 0){
                ii /= j;
            }
        }
        if(cnt == k - 2 && ii > 40000){
            srep(j,200,1500){
                if(j * j > ii)break;
                if(ii % j == 0 && j * j != ii){
                    ans++;
                    break;
                }
            }
        }
    }

    cout << ans << endl;
    return 0;
}