#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n,k;
vector<int>vi;
vector<ll>ans;
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
ll F[1000005],R[1000005];
void make(){
	F[0] = 1;
	for(int i=1;i<1000005;i++) F[i] = F[i-1]*i%mod;
	for(int i=0;i<1000005;i++) R[i] = modpow(F[i],mod-2);
}
ll C(int a,int b){
	return F[a]*R[b]%mod*R[a-b]%mod;
}
int main(){ make();
	cin >> n >> k;
	for(int i=1;i*i<=n;i++) if(n%i==0){
		vi.pb(i);
		if(i*i < n) vi.pb(n/i);
	}
	SORT(vi);
	rep(i,vi.size()){
		int x = n / vi[i];
		if(k%x != 0){
			ans.pb(0);
		}
		else{
			ll cur = C(vi[i],k/x);
			rep(j,i){
				if(vi[i]%vi[j] == 0) cur -= ans[j];
			}
			ans.pb(cur);
		}
	}
	ll ret = 0; rep(i,ans.size()-1) ret+=ans[i];
	cout<<(ret%mod+mod)%mod<<endl;
}