#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double db;

inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}

int pr[70],mu[70];
bool vis[70];
inline void LinearSieve(){
    for(int i=2;i<60;++i){
        if(!vis[i]) pr[++pr[0]]=i,mu[i]=-1;
        for(int j=1;j<=pr[0]&&i*pr[j]<60;++j){
            vis[i*pr[j]]=1,mu[i*pr[j]]=-mu[i];
            if(i%pr[j]==0){
                mu[i*pr[j]]=0;
                break;
            }
        }
    }
}

ll n;
int k;
ll cnt[70],ans;

int main(){
    scanf("%lld%d",&n,&k);
    if(k==1) return printf("%lld\n",n),0;
    if(k>=60) return printf("1\n"),0;
    LinearSieve();
    for(int i=2;i<=60;++i){
        ll l=1,r=(i==2)?1e9:cnt[i-1];
        while(l<=r){
            ll mid=(l+r)>>1;
            if((ll)powl(mid,i-1)>n/mid) r=mid-1;
            else cnt[i]=mid,l=mid+1; 
        }
    }
    for(int i=2;i<=60;++i) --cnt[i];
    ans=1;
    for(int i=k;i<60;++i){
        for(int j=2;i*j<60;++j){
            cnt[i]+=1ll*mu[j]*cnt[i*j];
        }
        ans+=cnt[i];
    }
    printf("%lld\n",ans);
    return 0;
}