#include <stdio.h>
#include <vector>
using namespace std;
#define PB push_back

typedef long long int ll;
constexpr int kMod = int(1E9 + 7), kN = int(2E5 + 10);

ll mu[kN];
vector<int> prime;

void pre() {
	mu[1] = 1;
	for (int i = 2; i < kN; i++) mu[i] = -2;
	for (int i = 2; i < kN; i++) {
		if (mu[i] == -2) {
			mu[i] = kMod - 1;
			prime.PB(i);
		}
		for (int j : prime) {
			if (i * j >= kN) break;
			mu[i * j] = kMod - mu[i];
			if (i % j == 0) {
				mu[i * j] = 0;
				break;
			}
		}
	}
	return ;
}

int main() {
	int n, m;
	ll ans = 0;
	scanf("%d%d", &n, &m);
	pre();
	if (n < m) printf("0\n");
	else {
		for (int k = 1; k <= n / m; k++) 
			ans += mu[k] * (n / k / m) * (n / k / m) % kMod;
		ans = (ans + kMod - 1) % kMod;
		for (int i = 1; i <= n - 2; i++) ans = ans * i % kMod;
		printf("%lld\n", ans% kMod);
	}
}