#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N;
long K;
const int LIM=20;
long ans;
vector<long>P;
void f(long k,int n)
{
	if(k==0)return;
	ans+=upper_bound(P.begin(),P.end(),k)-P.begin();
	for(int m=min((long)n,k);m>LIM;m--)
	{
		f(k/m,m-1);
	}
}
main()
{
	cin>>N>>K;
	if(N<=LIM)
	{
		for(int i=1;i<1<<N;i++)
		{
			long t=1;
			for(int j=0;t<=K&&j<N;j++)if(i>>j&1)t*=j+1;
			if(t<=K)ans++;
		}
		cout<<ans<<endl;
		return 0;
	}
	for(int i=0;i<1<<LIM;i++)
	{
		long t=1;
		for(int j=0;t<=K&&j<LIM;j++)if(i>>j&1)t*=j+1;
		if(t<=K)P.push_back(t);
	}
	sort(P.begin(),P.end());
	f(K,N);
	cout<<ans-1<<endl;
}