#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <functional>
#include <map>
using namespace std;

long long n, m, mod = 1000000007; bool primes[1000009];

long long euler_phi(long long p) {
	long long r = p;
	for (int i = 2; i * i <= p; i++) {
		if (p % i == 0) r = 1LL * r * (i - 1) / i;
		while (p % i == 0) p /= i;
	}
	if (p != 1) r = 1LL * r * (p - 1) / p;
	return r;
}

long long prime(long long p) {
	if (p == 0) return 0;
	long long R = 0;
	for (int i = 1; i <= p; i++) {
		R += euler_phi(i);
	}
	R--;
	R *= 2;
	return R;
}

int main() {
	for (int i = 2; i <= 1000008; i++) primes[i] = true;
	for (int i = 2; i*i <= 1000008; i++) {
		for (int j = i*i; j <= 1000008; j += i) primes[j] = false;
	}
	cin >> n >> m;
	long long G = prime(n / m);
	long long ret = 1;
	for (int i = 1; i <= n - 2; i++) { ret *= i; ret %= mod; }
	ret *= (G % mod); ret %= mod;
	cout << ret << endl;
	return 0;
}