#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N, M;
int dp[100001];
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> M;
  int s = 0, n = N/M;
  if (n) {
    for (int x=n; x>=1; x--) {
      dp[x] = (1LL*(n/x)*(n/x)) % MOD;
      for (int k=2; x*k<=n; k++) dp[x] += MOD-dp[x*k], dp[x] %= MOD;
    }
    s = dp[1]-1;
  }
  for (int i=1; i<=N-2; i++) s = (1LL*s*i) % MOD;
  cout << s << "\n";
  return 0;
}