#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+10,M=1e9+7;
int n,m; 
bool vis[N];
int p[N],k=0,phi[N];
inline void pre(){
	for(int i=2;i<=1e5;i++){
		if(!vis[i]) p[++k]=i,phi[i]=i-1;
		for(int j=1;j<=k&&p[j]*i<=1e5;j++){
			vis[p[j]*i]=1;
			if(i%p[j]==0){
				phi[p[j]*i]=p[j]*phi[i];
				break;
			}
			phi[p[j]*i]=(p[j]-1)*phi[i];
		}
	}
}
signed main(){
	//freopen("gcdlcm.in","r",stdin);
	//freopen("gcdlcm.out","w",stdout);
	pre();	
	cin>>n>>m;
	int ans=0;
	for(int i=2;i<=n/m;i++) ans+=phi[i],ans%=M; 
	for(int i=1;i<=n-2;i++) ans=ans*i%M;
	ans=ans*2%M;
	cout<<ans<<'\n';
	return 0;
}