#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1000010;
const int mod=1e9+7;
int ss[N],m;
bool vis[N];
int phi[N],mu[N];
int jc[N];
void init(int n){
	jc[0]=1;
	for(int i=1;i<=n;i++)jc[i]=jc[i-1]*i%mod;
	phi[1]=1;
	mu[1]=1;
	for(int i=2;i<=n;i++){
		if(!vis[i]){
			ss[++m]=i;
			phi[i]=i-1;
			mu[i]=-1;
		}
		for(int j=1;j<=m&&i*ss[j]<=n;j++){
			vis[i*ss[j]]=1;
			if(i%ss[j]==0){
				phi[i*ss[j]]=phi[i]*ss[j];
				mu[i*ss[j]]=0;
				break;
			}
			phi[i*ss[j]]=phi[i]*(ss[j]-1);
			mu[i*ss[j]]=-mu[i];
		}
	}
	return;
}
int n,k;
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	// freopen("gcdlcm.in","r",stdin);
	// freopen("gcdlcm.out","w",stdout);
	init(N-10);
	cin>>n>>k;
	if(k>n){
		cout<<"0\n";
		return 0;
	}
	int ans=0;
	for(int d=1;d<=(n/k);d++)ans=(ans+((n/k)/d)*((n/k)/d)%mod*mu[d]%mod)%mod;
	ans--;
	ans=(ans%mod+mod)%mod;
	cout<<ans*jc[n-2]%mod<<"\n";
	return 0;
}
/*
??????????gcd
*/