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

int n,k;
int sele;

const int MAX = 1000001;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    //cout<<"poyo"<<endl;
    if (n < 0 || k < 0) return 0;
    //cout<<"pay"<<endl;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int gcd(int a,int b){
    if(a%b==0)return b;
    return gcd(b,a%b);
}

int yakuc(int a){
    int ret=0;
    for(int i=2; i*i<=a; i++){
        if(a%i==0){
            ret++;
        }
        if(a/i!=i){
            ret++;
        }
    }
    return ret;
}

void solve(){
    COMinit();
    cin>>n>>k;
    if(n==k){
        cout<<1<<endl;
        return;
    }
    int g=gcd(n,k);
    vector<int> yaku1;
    for(int i=2; i*i<=g; i++){
        if(g%i==0){
            yaku1.push_back(i);
        }
        if(g/i!=i){
            yaku1.push_back(g/i);
        }
    }
    if(g!=1)yaku1.push_back(g);
    long long int ans=0;
    for(int i=0; i<yaku1.size(); i++){
        //cout<<"yaku"<<yaku1[i]<<endl;

        long long int comb=COM(n/yaku1[i],k/yaku1[i]);
        //cout<<"comb"<<comb<<endl;
        long long int cnt=yakuc(yaku1[i]);
        if(cnt>0){
            ans-=(cnt-1)*comb;
            ans%=MOD;
            if(ans<0)ans+=MOD;
        }
        else {
            ans+=comb;
            ans%=MOD;
            if(ans<0)ans+=MOD;
        }
    }
    cout<<ans<<endl;
}

int main(){
    //while(1)
    solve();
    return 0;
}