#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

#define MOD 1000000007
int a[100005], b[100005];
int dp[100005];
void phi_all(int N) {
  rep(i, N+1) {
    a[i] = 1;
    b[i] = i;
  }
  rep(k, N+1) {
    if (b[k] < 2) continue;
    for(int n = k; n <= N; n += k) {
      for(int m = k-1; b[n]%k == 0; m = k) {
        a[n] *= m;
        b[n] /= k;
      }
    }
  }
  // a[n] == phi(n), b[n] == 1
}

int main(){
  int N, M;
  cin >> N >> M;
  phi_all(100001);
  REP(i,2,100001){
    dp[i] = dp[i-1] + a[i];
    dp[i] %= MOD;
  }
  
  ll pp = 1;
  rep(i,N-2){
    pp *= i+1;
    pp %= MOD;
  }

  ll ret = 0;
  ret += (2 * dp[N/M] * pp) % MOD;
  ret %= MOD;

  cout << ret << endl;
  
  return 0;
}