#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const int mod = 1e9 + 7;
const int N = 5e5 + 7;
bool vis[N];
int fac[N], pr[N], tot = 0, mu[N];
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    fac[0] = 1;
    for (int i = 1; i < N; i++)
        fac[i] = fac[i - 1] * i % mod;
    vis[1] = 1;
    mu[1] = 1;
    for (int i = 2; i < N; i++)
    {
        if (!vis[i])
            pr[++tot] = i, mu[i] = -1;
        for (int j = 1; j <= tot && i * pr[j] < N; j++)
        {
            vis[i * pr[j]] = 1;
            if (i % pr[j] == 0)
                break;
            mu[i * pr[j]] = -mu[i];
        }
    }
    for (int i = 2; i < N; i++)
        (mu[i] += mu[i - 1]) %= mod;
    for (int i = 1; i < N; i++)
        mu[i] = (mu[i] % mod + mod) % mod;
    int n, m;
    cin >> n >> m;
    if (m >= n)
    {
        cout << 0;
        return 0;
    }

    int res = mod - 1;
    for (int L = 1, R; L <= n / m; L = R + 1)
    {
        R = n / m / (n / m / L);
        (res += ((mu[R] - mu[L - 1]) % mod + mod) % mod * (n / m / L) % mod * (n / m / L) % mod) %= mod;
    }
    cout << res * fac[n - 2] % mod;
}