#include #include #include #include #include #include #include #include #include #include #include using ll = long long; using namespace std; int main(){ int n, k, ans1 = 0; cin >> n >> k; vector prime(n + 1, 1), ans(n+1); prime[0] = 0; prime[1] = 0; for (int i = 2; i*i <= n; i++){ for (int j = i*i; j <= n; j += i) prime[j] = 0; } for (int i = 2; i <= n; i++){ if (prime[i]){ for (int j = i; j <=n; j += i) ans[j]++; } if (ans[i] >= k) ans1++; } cout << ans1 << endl; }