#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define seg_size 524288
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
vector<int> sosuu;
int main() {
#define int long long
	int n, m;
	for (int i = 2;i <= 100000;++i) {
		int cat = 0;
		for (int q = 2;q <= sqrt(i);++q) {
			if (i % q == 0) {
				cat = 1;
				break;
			}
		}
		if (cat == 0) {
			sosuu.push_back(i);
		}
	}
	cin >> n >> m;
	long long ans = 0;
	int total = n / m;
	ans += total * (total - 1LL);
	ans %= MAX_MOD;
	for (int i = 1;i <= n / m;++i) {
		vector<int> insuu;
		for (int q = 0;q < sosuu.size()&&sosuu[q] <= i;++q) {
			if (i % sosuu[q] == 0) insuu.push_back(sosuu[q]);
		}
		ans %= MAX_MOD;
		for (int q = 1;q < (1LL << insuu.size());++q) {
			int mew = q;
			int cnt = 0;
			int nowing = 1;
			int tele = 0;
			while (mew != 0) {
				if (mew % 2 == 1) {
					cnt++;
					nowing *= insuu[tele];
					if (nowing > total) break;
				}
				tele++;
				mew /= 2;
			}
			if (cnt % 2 == 1) {
				ans -= (total / nowing) * (total / nowing - 1LL);
				ans %= MAX_MOD;
				ans += (llabs(ans) / MAX_MOD + 1) * MAX_MOD;
				ans %= MAX_MOD;
			}
			else {
				ans += (total / nowing) * (total / nowing - 1LL);
				ans %= MAX_MOD;
			}
		}
	}
	ans %= MAX_MOD;
	for (int i = n - 2;i >= 1;--i) {
		ans *= i;
		ans %= MAX_MOD;
	}
	cout << ans << endl;
	return 0;
}