#include <bits/stdc++.h>

#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using ld = long double;

template <typename T>
vector<T> Vec(int n, T v)
{
    return vector<T>(n, v);
}
template <class... Args>
auto Vec(int n, Args... args)
{
    auto val = Vec(args...);
    return vector<decltype(val)>(n, move(val));
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = (ll)1e9 + 7LL;
constexpr ld PI = static_cast<ld>(3.1415926535898);
template <typename T>
constexpr T INF = numeric_limits<T>::max() / 10;


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    ll M;
    cin >> N >> M;
    vector<ll> fact(N + 1);
    fact[0] = 1;
    for (int i = 1; i <= N; i++) {
        fact[i] = (fact[i - 1] * i) % MOD;
    }
    if (M > N) {
        cout << 0 << endl;
        return 0;
    }
    const ll f = 2 * fact[N - 2] % MOD;
    N /= M;
    vector<bool> isprime(N + 1, true);
    vector<ll> phi(N + 1, 0);
    for (int i = 2; i <= N; i++) {
        if (isprime[i]) {
            phi[i] = i - 1;
            for (int j = 2; i * j <= N; j++) {
                isprime[i * j] = false;
                phi[i * j] = phi[j] * (j % i == 0 ? i : i - 1) % MOD;
            }
        }
    }
    ll ans = 0;
    for (int i = 2; i <= N; i++) {
        ans += phi[i];
        ans %= MOD;
    }
    cout << ans * f % MOD << endl;

    return 0;
}