#include <bits/stdc++.h>
using namespace std;
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x,y,h,w) x >= 0 && x < h && y >= 0 && y < w

#define int long long
//typedef    long long          ll;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      P;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
 
const int INF=1e+18;
const double EPS=1e-9;
const int MOD=1000000007;
 
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

signed main(){
	int n,m,ans = 1,euler[100010],tmp = 0;
	cin >> n >> m;
	for(int i = 0;i < n - 2;i++) (ans *= i + 1) %= MOD;
	for(int i = 0;i <= n;i++) euler[i] = i;
	for(int i = 2;i <= n;i++){
		if(euler[i] == i){
			for(int j = i;j <= n;j += i) euler[j] = euler[j] / i * (i - 1);
		}
	}
	for(int i = 2;i * m <= n;i++) (tmp += euler[i] * 2) %= MOD;
	cout << tmp * ans % MOD << endl;
	return 0;
}