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

const int mod=1e9+7;
const int sz=1000010;

int fact[sz],inv[sz],ifact[sz];
void make(){
    fact[0]=fact[1]=inv[1]=ifact[0]=ifact[1]=1;
    for(int i=2;i<sz;i++){
        fact[i]=fact[i-1]*i%mod;
        inv[i]=inv[mod%i]*(mod-mod/i)%mod;
        ifact[i]=ifact[i-1]*inv[i]%mod;
    }
}
int comb(int n,int k){
    if(n<k) return 0;
    return fact[n]*ifact[k]%mod*ifact[n-k]%mod;
}

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    make();
    int N,K; cin>>N>>K;
    if(K==N){
        cout<<1<<endl;
        return 0;
    }

    vector<int> dp(N);
    int ans=0;
    for(int i=1;i<=N/2;i++){
        if(N%i!=0) continue;
        if(K%(N/i)==0){
            dp[i]=comb(i,K/(N/i));
            // cout<<i<<' '<<dp[i]<<endl;
            for(int j=1;j*j<=i;j++){
                if(i%j!=0) continue;
                if(K%(N/j)==0){
                    dp[i]=(dp[i]-dp[j]+mod)%mod;
                }
                int k=i/j;
                if(j==1 or k==j) continue;
                if(K%(N/k)==0){
                    dp[i]=(dp[i]-dp[k]+mod)%mod;
                }
            }
            ans=(ans+dp[i])%mod;
            // cout<<i<<' '<<dp[i]<<endl;
        }
    }
    cout<<ans<<endl;
    return 0;
}