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

long long gcd(long long a, long long b){
    if(b==0) return a;
    return gcd(b,a%b);
}
const int MAX = 1000010;
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;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

bool isprime(long long int val) {
    if (val <= 1)return false;
    for (long long int i = 2; i*i <= val; i++) {
        if (val%i == 0LL)return false;
    }
    return true;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(20);

    ll n,k;
    cin>>n>>k;
    ll g = gcd(n,k);
    if(k==1){
        cout << n << endl;
        return 0;
    }
    if(g==1){
        cout << 0 << endl;
        return 0;
    }
    COMinit();
    ll ans = 0;
    int cnt=0;
    for(ll i=1;i*i<=g;i++){
        if(g%i==0){
            if(isprime(i)) ans += COM(n/i,k/i),cnt++;
            ans %= mod;
            if(i*i!=g && isprime(g/i)) ans += COM(n/(g/i),k/(g/i)), cnt++;
            ans %= mod;
        }
    }
    ans -= (cnt-1)*COM(n/g,k/g);
    while(ans<0) ans+=mod;
    ans %= mod;
    cout << ans << endl;


}