#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <cctype>
#include <complex>
using namespace std;

#define INF_LL (ll)1e18
#define INF (int)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using ll = long long;
using PII = pair<int, int>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

const ll mod = 1e9+7;
ll fact[114514];

ll gcd(ll a, ll b){
	if(b == 0) return a;
	return gcd(b, a%b);
}


int main(void){
	ll N, M;
	fact[0] = 1;
	cin >> N >> M;
	FOR(i, 1, 114514){
		fact[i] = fact[i-1]*i%mod;
	}
	ll res = 0;
	cout << ((N/M-1)*fact[N-2]%mod)*(N/M)%mod << endl;
}