#include <bits/stdc++.h>
using namespace std;
int N, M, mobius[100009], mod = 1000000007; bool prime[100009];
long long solve(int x) {
	if(x == 0) return 0;
	fill(mobius, mobius + x + 1, 1);
	fill(prime + 2, prime + x + 1, true);
	for(int i = 2; i <= x; i++) {
		if(!prime[i]) continue;
		for(int j = i; j <= x; j += i) mobius[j] *= -1, prime[j] = false;
		if(1LL * i * i <= x) for(int j = i * i; j <= x; j += i * i) mobius[j] = 0;
	}
	long long ret = 0;
	for(int i = 1; i <= x; i++) ret += 1LL * mobius[i] * (x / i) * (x / i);
	return ret - 1;
}
int main() {
	cin >> N >> M;
	int ret = solve(N / M) % mod;
	for(int i = 1; i <= N - 2; i++) ret = 1LL * ret * i % mod;
	cout << ret << endl;
	return 0;
}