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

#define mod 1000000007
#define MAX_N 2000010
long long inv[MAX_N];
long long factorial[MAX_N];
long long inv_factorial[MAX_N];

void GetInv(){
    for (int i = 1; i < MAX_N; i++) {
        if (i == 1) inv[i] = 1;
        else {
            inv[i] = (mod - (mod / i) * inv[mod % i]) % mod;
            if (inv[i] < 0) inv[i] += mod;
        }
    }
}
void GetFactorial(){
    factorial[0] = 1; inv_factorial[0] = 1;
    for (int i = 1; i < MAX_N; i++) {
        factorial[i] = factorial[i-1] * i;
        factorial[i] %= mod;
        inv_factorial[i] = inv_factorial[i-1] * inv[i];
        inv_factorial[i] %= mod;
    }
}

long long combination(int n, int r) {
    long long ret = factorial[n] * inv_factorial[r];
    ret %= mod;
    ret *= inv_factorial[n-r];
    return ret % mod;
}

int main() {
    GetInv(); GetFactorial();
    int n, k; cin >> n >> k;
    int t = k;
    vector<int> v;
    for (int i = 2; i <= t; i++) {
        if (t % i == 0) {
            while (t % i == 0) {
                t /= i;
            }
            if (n % i == 0) v.emplace_back(i);
        }
    }
    long long ans = 0;
    int size = v.size();
    for (int i = 1; i < (1 << size); i++) {
        int cnt = 0;
        int r = 1;
        for (int k = 0; k < size; k++) {
            if (i & (1 << k)) {
                cnt++; r *= v[k];
            }
        }
        long long tmp = combination(n / r, k / r);
        if (cnt % 2 == 0) tmp = mod - tmp;
        ans = (ans + tmp) % mod;
    }
    cout << ans << endl;
    return 0;
}