/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.17 20:11:24
**/

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


template < typename T >
T gcd(T a, T b) {
    return b ? gcd(b, a % b) : a;
}
constexpr int MOD = 1e9 + 7;
struct mint {
private:
    long long x;
public:
    mint(long long x = 0) : x((MOD + x) % MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint &operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint &operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint &operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint &operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream &operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
};

struct Combination {
private:
    int N;
    vector< mint > FACT, IFACT;
    
    mint pow(mint k, ll n) {
        mint res = 1;
        while (n > 0) {
            if (n & 1) {
                res *= k;
            }
            k *= k;
            n >>= 1;
        }
        return res;
    }
public:
    
    Combination(int n) : N(n) {
        FACT.resize(n + 1);
        IFACT.resize(n + 1);
        FACT[0] = 1;
        IFACT[0] = 1;
        for (int i = 1; i <= n; i++) {
            FACT[i] = FACT[i - 1] * i;
            IFACT[i] = pow(FACT[i], MOD - 2);
        }
    }
    mint comb(int n, int r) {
        if (n < 0 || r < 0 || r > n) return 0;
        if (r > n / 2) r = n - r;
        return FACT[n] * IFACT[n - r] * IFACT[r];
    }
};


template < typename T >
vector< pair< T, int > > prime_factorization(T n) {
    vector< pair< T, int > > res;
    for (T i = 2; i * i <= n; i++) {
        int cnt = 0;
        while (n % i == 0) {
            n /= i;
            cnt++;
        }
        if (cnt > 0) res.push_back({i, cnt});
    }
    if (n > 1) res.push_back({n, 1});
    return res;
}
int bitpopcount(ll n) {
    int res = 0;
    while (n) {
        if (n & 1) res++;
        n >>= 1;
    }
    return res;
}
int main() {
    int n, k;
    cin >> n >> k;
    ll g = gcd(n, k);
    if (g == 1) {
        cout << 0 << endl;
    } else {
        Combination cb(n);
        auto v = prime_factorization(g);
        vector< mint > dp(1 << v.size(), 0);
        mint ans = 0;
        for (int i = 1; i < 1 << v.size(); i++) {
            ll t = 1;
            for (int j = 0; j < v.size(); j++) {
                if (i & (1 << j)) {
                    t *= v[j].first;
                }
            }
            dp[i] = cb.comb(n / t, k / t);
            if (bitpopcount(i) & 1) {
                ans += dp[i];
            }
            else {
                ans -= dp[i];
            }
        }
        cout << ans << endl;
    }
    return 0;
}