#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
int main()
{
	int n, m;
	cin>>n>>m;
	if(m>n){
		cout<<0<<endl;
		return 0;
	}
	ll ct[100001];
	ct[n/m]=1;
	for(ll i=n/m-1; i>=1; i--){
		ct[i]=(n/m/i)*(n/m/i);
		for(int j=2*i; j<=n/m; j+=i){
			ct[i]-=ct[j];
		}
	}
	ll ans=(ct[1]-1)%MOD;
	for(ll i=1; i<=n-2; i++){
		ans*=i; ans%=MOD;
	}
	cout<<ans<<endl;
	return 0;
}