#include <bits/stdc++.h>

std::vector<int> euler_phi(int N) {
    N++; std::vector<int> ret(N);
    std::iota(std::begin(ret), std::end(ret), 0);
    for (int i = 2; i < N; i++) {
        if (ret[i] == i) {
            for (int j = i; j < N; j += i) {
                ret[j] /= i;
                ret[j] *= (i - 1);
            }
        }
    }
    return ret;
}

using namespace std;

const int MOD = 1e9 + 7;
int N, M;
vector<int> phi;

void naive(int n, int m) {
    long long ans = 0;
    long long fact = 1;
    for (int i = 2; i <= N - 2; i++) {
        (fact *= i) %= MOD;
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (__gcd(i + 1, j + 1) == m) {
                (ans += fact) %= MOD;
            }
        }
    }
    cout << ans * 2 % MOD << endl;
}

int main() {
    cin >> N >> M;
    //naive(N, M);
    phi = euler_phi(N);
    long long fact = 1;
    for (int i = 2; i <= N - 2; i++) {
        (fact *= i) %= MOD;
    }
    long long ans = 0;
    for (int i = 2; i <= N / M; i++) {
        (ans += fact * phi[i]) %= MOD;
    }
    cout << ans * 2 % MOD << endl;
}