#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e11;
ll n,k,fac[205],two[205];
map<ll,ll>dp;
ll dfs(ll x,ll now,bool hasV){
	ll hash=(x*INF+now)*2+hasV;
	if(dp.count(hash)){
		return dp[hash];
	}
	ll ans=0;
	if(now>=fac[x]){
		ans=two[x]-1+hasV;
	}
	else{
		ans=(ans+dfs(x-1,now,hasV));
		ans=(ans+dfs(min(now/x,x-1),now/x,1));
	}
	return dp[hash]=ans;
}
int main(){
	scanf("%lld%lld",&n,&k);
	fac[0]=two[0]=1;
	for(int i=1;i<=40;++i){
		two[i]=2ll*two[i-1];
	}
	for(int i=1;i<=n;++i){ 
		fac[i]=1ll*fac[i-1]*i;
		fac[i]=min(fac[i],INF);
	}
	printf("%lld\n",dfs(min(n,k),k,0));
	return 0; 
}
/*
100 1000000000
1480348241
200 10000000000
44692356573
*/