#include <iostream>
#include <cstdio>

using namespace std;

const int N = 1000010, MOD = 1000000007;

int n, k, f[N], fac[N], ifac[N], inv[N], ans;

int GCD(int x, int y) {
    return y ? GCD(y, x % y) : x;
}

void Init() {
    fac[0] = ifac[0] = 1;
    fac[1] = inv[1] = ifac[1] = 1;
    for (int i = 2; i < N; ++i) {
        fac[i] = 1LL * fac[i - 1] * i % MOD;
        inv[i] = 1LL * (MOD - MOD / i) * inv[MOD % i] % MOD;
        ifac[i] = 1LL * ifac[i - 1] * inv[i] % MOD;
    }
}

int C(int x, int y) {
    if (y < 0 || x < y) return 0;
    return 1LL * fac[x] * ifac[y] % MOD * ifac[x - y] % MOD;
}

int main() {
    // freopen("cycle.in", "r", stdin);
    // freopen("cycle.out", "w", stdout);

    Init();
    scanf("%d%d", &n, &k);
    
    int x = GCD(n, k);
    for (int i = x; i >= 2; --i) {
        if (x % i != 0) continue; 
        (f[x / i] += C(n / i, k / i)) %= MOD;
        (ans += f[x / i]) %= MOD;
        for (int j = 2 * x / i; j <= x; j += x / i) {
            if (x % j == 0) {
                (((f[j] -= C(n / i, k / i)) %= MOD) += MOD) %= MOD;  
            }
        }
    }

    printf("%d\n", ans);

    return 0;
}