#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
ll inv[10000100];
ll FactorialInv[10000100];
ll Factorial[10000100];
ll beki(ll a, ll b){
    if(b == 0){
        return 1;
    }
    ll ans = beki(a, b / 2);
    ans = ans * ans % mod;
    if(b % 2 == 1){
        ans = ans * a % mod;
    }
    return ans;
}
void init_combination(){
    const int MAX = 10000002;
    Factorial[0] = 1;
    inv[0] = 1;
    for(int i = 1; i <= MAX; i++){
        Factorial[i] = Factorial[i - 1] * i % mod;
    }
    FactorialInv[MAX] = beki(Factorial[MAX], mod - 2);
    for(ll i = MAX - 1; i >= 0; i--) {
        FactorialInv[i] = FactorialInv[i+1] * (i+1) % mod;
    }
    for(int i = 1; i <= MAX; i++) {
        inv[i] = FactorialInv[i] * Factorial[i-1] % mod;
    }
}
ll combination(ll a, ll b){
    if((a == b) || (b == 0)){
        return 1;
    }
    if(a < b) return 0;
    ll ans = Factorial[a] * FactorialInv[b] % mod;
    ans = ans * FactorialInv[a - b] % mod;
    return ans;
}
ll N, K;
map<ll, ll> mp;

vector<ll> f(ll x) {
    vector<ll> v;
    v.push_back(1);
    for(ll i = 2; i * i <= N; i++) {
        if(x % i != 0) continue;
        v.push_back(i);
        if(i * i != N) v.push_back(N / i);
    }
    sort(v.begin(), v.end());
    return v;
}

vector<ll> g(ll x) {
    vector<ll> ret;
    for(ll i = 2; i * i <= x; i++) {
        if(x % i == 0) {
            ret.push_back(i);
            while(x % i == 0) x /= i;
        }
    }
    if(x != 1) ret.push_back(x);
    return ret;
}

int counter(ll a) {
    if(a == 0) return 0;
    return (a & 1) + counter(a >> 1);
}

int main() {
    init_combination();
    cin >> N >> K;
    vector<ll> divisors = f(N);
    ll ans = 0;
    for(auto range : divisors) {
        ll val = N / range;
        if(K % val != 0) continue;
        ll now = combination(range,  K / val);
        mp[range] = now;
        //cerr << val << " " << range << " " << now << endl;
        vector<ll> p = g(range);
        for(ll bit = 1; bit < (1LL << (int)p.size()); bit++) {
            ll nowrange = range;
            for(int i = 0; i < p.size(); i++) {
                if(bit & (1LL << i)) nowrange /= p[i];
            }
            if(counter(bit) & 1LL) now -= mp[nowrange];
            else now += mp[nowrange];
            now += mod;
            now %= mod;
        }
        now %= mod;
        now += mod;
        now %= mod;
        ans = (ans + now) % mod;
    }
    cout << ans << endl;
    return 0;
}