#include <bits/stdc++.h>
using namespace std;

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second

#define DUMP(x) cout<<#x<<":"<<(x)<<endl
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class T>
istream& operator>>(istream& is, vector<T>& xs){
  for(auto& x: xs)
	is >> x;
  return is;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& xs){
  for(unsigned int i=0;i<xs.size();++i)
	os << (i?" ":"") << xs[i];
  return os;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  LL N, M;
  cin >> N >> M;

  LL num = N / M;
  if(num < 2) cout << 0 << endl;
  else{
	VL ps(num+1, -1), tot(num+1, 1);
	FOR(i,2,num+1) ps[i] = i;
	for(int i=2;i<=num;++i){
	  if(ps[i] == i){
		tot[i] = i-1;
		for(int j=i+i;j<=num;j+=i){
		  LL p = 1;
		  while(ps[j] % i == 0){
			ps[j] /= i;
			p *= i;
		  }
		  tot[j] *= p - p/i;
		}
	  }
	}

	LL ans = 0;
	for(LL i=2;i<=num;++i){
	  (ans += tot[i]) %= MOD;
	}
	ans = ans * 2 % MOD;
	for(LL i=1;i<=N-2;++i)
	  ans = ans * i % MOD;
	cout << ans << endl;
  }

  return 0;
}