#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

const long long mod = 1e9 + 7;

int main() {
  long long n, m;
  cin >> n >> m;

  vector<long long> phi(n + 1);
  for (int i = 1; i <= n; i++) {
    phi[i] = i;
  }

  for (int i = 2; i <= n; i++) {
    if (phi[i] == i) {
      for (int j = i; j <= n; j += i) {
        phi[j] = phi[j] / i * (i - 1);
      }
    }
  }

  long long ans = 0;
  for (int i = 1; i <= n / m; i++) {
    ans += phi[i];
  }

  if (m <= n) ans--;
  ans *= 2;

  for (int i = 1; i <= n - 2; i++) {
    ans *= i;
    ans %= mod;
  }

  cout << ans << endl;
}