// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
// #include "../debug/debug.cpp"
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

const ll mod = 1e9 + 7;

template <ll MOD>
class Combination {
private:
    template <typename T> using V = vector<ll>;
    ll N;
    V<ll> factv, rfactv;

public:
    /*
     * MOD must be a prime number.
     */
    Combination<MOD> (ll N)
        : N(N), 
          factv(N + 1, 1),
          rfactv(N + 1)
    {
        for(ll i = 1; i <= N; i++) {
            factv[i] = factv[i - 1] * i % MOD;
        }
        for(ll i = 0; i <= N; i++) {
            rfactv[i] = pow(factv[i], MOD - 2);
        }
    }

    ll fact(ll n) {
        return factv[n];
    }

    ll rfact(ll n) {
        return rfactv[n];
    }

    ll pow(ll a, ll b) {
        return b ? (b & 1 ? a : 1) * pow(a * a % MOD, b / 2) % MOD : 1;
    }

    ll comb(ll n, ll k) {
        return factv[n] * rfactv[n - k] % MOD * rfactv[k] % MOD;
    }
};

Combination<mod> C(1e6 + 10);
/*
    V<ll> primes;
    V<bool> used(N + 10, false);
    for(ll i = 2; i < N; i++) {
        if(used[i]) continue;
        primes.push_back(i);
        for(ll j = 1; i * j < used.size(); j++) used[i * j] = true;
   }
   */

using BS = bitset<16>;

int main() {

    ll N, K;
    cin >> N >> K;
    ll ans = 0;
    V<ll> unit_lis;
    {
        ll cpy = N;
        for(ll i = 2; i * i <= N; i++) {
            ll cnt = 0;
            while(cpy % i == 0) {
                cpy /= i;
                cnt++;
            }
            if(cnt) unit_lis.push_back(i);
        }
        if(1 < cpy) unit_lis.push_back(cpy);
    }
    for(ll S = 1; S < (1ll << unit_lis.size()); S++) {
        BS bs(S);
        ll mul = 1;
        for(ll i = 0; i < unit_lis.size(); i++) if(bs.test(i)) mul *= unit_lis[i];
        ll unit_size = N / mul;
        ll unit_cnt = N / unit_size;
        DEBUG(mul);
        if(K % unit_cnt) continue;
        ll val = C.comb(unit_size, K / unit_cnt);
        if(bs.count() % 2 == 0) val = mod - val;
        (ans += val) %= mod;
    }
    cout << ans << endl;
    return 0;
}
/*
    sort(ALL(unit_lis));
    DEBUG(unit_lis);
    V<ll> cnt_v(N + 10, 0);
    for(auto unit_size : unit_lis) {
        for(ll i = 1; i * unit_size < cnt_v.size(); i++) {
            auto ite = lower_bound(ALL(unit_lis), i * unit_size);
            if(ite == unit_lis.end()) continue;
            if(*ite != i * unit_size) continue;
            cnt_v[i * unit_size]++;
        }
    }
    for(auto unit_size : unit_lis) {
        ll unit_cnt = N / unit_size;
        ll point_per_unit = K / unit_cnt;
        // if(unit_size < point_per_unit) continue;
        DEBUG(make_tuple(unit_size, unit_cnt, point_per_unit));
        DEBUG(cnt_v[unit_size]);
        DEBUG(C.comb(unit_size, point_per_unit));
        ll val = C.comb(unit_size, point_per_unit);
        (ans += mod + val * (cnt_v[unit_size] & 1 ? 1 : -1)) %= mod;
    }
    DEBUG(cnt_v);
    cout << ans << endl;
    return 0;
}
*/