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

#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
const int inf = 1000000001;
const ll INF = 2e18 * 2;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };


ll gcd(ll a, ll b) {
	if (b > a) {
		swap(a, b);
	}
	ll r = a%b;
	while (r != 0) {
		a = b;
		b = r;
		r = a%b;
	}
	return b;
}

ll lcm(ll a, ll b) {
	return (a / gcd(a, b))*b;
}


void prime(vector<bool> &isprime, vll &soinsu) {
	ll i, j;
	isprime[0] = isprime[1] = false;
	for (i = 2; i < isprime.size(); i++) {
		if (isprime[i]) {
			soinsu[i].push_back(i);
			for (j = 2; i*j < isprime.size(); j++) {
				isprime[i*j] = false;
				soinsu[i * j].push_back(i);
				int temp = i * j;
				while (temp % i == 0) {
					temp /= i;
				}
			}
		}
	}
}

int main() {
	ll n, m;
	cin >> n >> m;
	ll i, j;
	vl fact(n + 1);
	fact[0] = fact[1] = 1;
	for (i = 2; i <= n; i++) {
		fact[i] = fact[i - 1] * i % MOD;;
	}

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

	ll sum = 0;
	for (i = 2; i <= n / m; i++) {
		(sum += euler[i]) %= MOD;
	}
	(sum *= fact[n - 2]) %= MOD;
	(sum *= 2) %= MOD;
	cout << sum << endl;
}