#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define MULT_TEST 0
using namespace std;
typedef long double ldb;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
    int w = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        w = (w << 1) + (w << 3) + ch - 48;
        ch = getchar();
    }
    return w * f;
}
const int N = 1000000, MAXN = 1E9;
int vis[N + 10];
inline void Solve() {
    int n, k, ans = 1, sum = 0;
    n = read(), k = read();
    if (k >= 60) return printf("1\n"), void();
    if (k == 1) return printf("%lld\n", n), void();
    for (int i = 2; i <= N; i++) {
        if (vis[i]) continue;
        for (int p = i, j = 1; p <= n; j++) {
            if (j >= k) {
                if (p <= N) vis[p] = 1;
                else if (p > N && p <= MAXN) sum++;
                ans++;
            }
            if (p <= n / i) p = p * i;
            else break;
        }
    }
    if (k == 2) ans += max(min(n, MAXN) - N - sum, 0ll);
    printf("%lld\n", ans);
}
signed main() {
    int _ = 1;
#if MULT_TEST
    _ = read();
#endif 
    while (_--) Solve();
    return 0;
}