#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int N,K;
vector<int>A;
long mod=1e9+7,ans[1<<17];
long power(long a,long b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
long F[1<<20],I[1<<20];
long C(int a,int b){return F[a]*I[b]%mod*I[a-b]%mod;}
main()
{
	cin>>N>>K;
	if(N==K)
	{
		cout<<(N>1)<<endl;
		return 0;
	}
	F[0]=1;
	for(int i=1;i<=N;i++)F[i]=F[i-1]*i%mod;
	I[N]=power(F[N],mod-2);
	for(int i=N;i--;)I[i]=I[i+1]*(i+1)%mod;
	for(int i=2;i*i<=N;i++)
	{
		if(N%i==0)
		{
			A.push_back(i);
			if(i<N/i)A.push_back(N/i);
		}
	}
	sort(A.begin(),A.end());
	long ret=0;
	for(int i=0;i<A.size();i++)
	{
		int k=A[i];
		if(K%(N/k))continue;
		int x=K/(N/k);
		ans[i]=C(k,x);
		for(int j=0;j<i;j++)
		{
			if(A[i]%A[j]==0)(ans[i]+=mod-ans[j])%=mod;
		}
		(ret+=ans[i])%=mod;
	}
	cout<<ret<<endl;
}