#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,K;

const int MAX = 1111111;
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;
}

void solve() {
    cin>>N>>K;
    
    COMinit();
    
    vector<int> primes;
    primes.push_back(2);
    FOR(i,3,1e4) {
        bool ok = true;
        for (auto p:primes) {
            if (i%p==0) {
                ok=false;
                break;
            }
        }
        if (ok) primes.push_back(i);
    }
    
    vector<int> D;
    int k = K;
    for(auto p:primes) {
        if (N%p==0 && K%p==0) {
            D.push_back(p);
        }
        while (k%p==0) k/=p;
    }
    if (k>1 && N%K==0) D.push_back(k);
//    for (auto d:D) cout << d << " ";
//    cout << endl;
    
    int ans = 0;
    REP(i,1<<D.size()) {
        int d = 1;
        bitset<30> bit(i);
        REP(j,D.size()) {
            if (i&(1<<j)) {
                d *= D[j];
            }
        }
        if (d==1) continue;
        if (N%d==0 && K%d==0) {
            int diff = COM(N/d, K/d);
            if (bit.count()%2==0) diff *= -1;
//            out("%lld: %lld C %lld = %lld\n", d, N/d, K/d, diff);
            ans += diff;
            if (ans < 0) ans += MOD;
            ans %= MOD;
        }
    }
    cout << ans << endl;
}