#include <bits/stdc++.h>
#define forn(i,s,t) for(int i=(s); i<=(t); ++i)
#define form(i,s,t) for(int i=(s); i>=(t); --i)
#define rep(i,s,t) for(int i=(s); i<(t); ++i)
using namespace std;
typedef double f64;
typedef long long i64;
typedef unsigned long long u64;
const int N = 2e3 + 3, M = 2e5 + 4, Mod = 1e9 + 7;
struct mint {
	int r;
	mint() {}
	mint(int _r) : r(_r) {}
	inline friend mint operator + (const mint& A, const mint& B) {
		return mint((A.r + B.r >= Mod) ? (A.r + B.r - Mod) : (A.r + B.r));
	}
	inline friend mint operator - (const mint& A, const mint&B) { return A + mint(Mod - B.r);}
	inline friend mint operator * (const mint& A, const mint& B) { return mint(1ll * A.r * B.r % Mod); } 
	inline friend mint& operator += (mint& A, const mint& B) { return A = A + B; }
	inline friend mint& operator -= (mint& A, const mint& B) { return A = A - B; }
	inline friend mint& operator *= (mint& A, const mint& B) { return A = A * B; }
	inline friend mint q_pow(mint p, int k = Mod - 2) {
		mint r = 1;
		for (; k; k >>= 1, p *= p) (k & 1) && (r *= p, 0);
		return r;
	}
};
mint fac[N << 1], ifac[N << 1];
inline void table(int n = 4e3) {
	fac[0] = 1;
	forn (i, 1, n) fac[i] = fac[i - 1] * mint(i);
	ifac[n] = q_pow(fac[n]);
	form (i, n - 1, 0) ifac[i] = ifac[i + 1] * mint(i + 1);
}
inline mint C(int n, int r) {
	if (n < 0 || r < 0 || n < r) return mint(0);
	return fac[n] * ifac[r] * ifac[n - r];
}
int n, m, sz[N]; mint dp[N][N];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	table();
	cin >> n >> m;
	rep (i, 0, m) {
		sz[i + 1] = (i != 0);
		for (int j = i + m; j <= 2 * n; j += m) sz[i + 1] ++ ;
	}
	dp[0][0] = 1;
	int sum = 0;
	forn (j, 1, m) {
		sum += sz[j] / 2;
		forn (i, 0, sum) forn (k, 0, min(sz[j] / 2, i)) 
			dp[i][j] += dp[i - k][j - 1] * C(sz[j], 2 * k) * fac[2 * k] * C(i, k);
	}
	mint ans = 0;
	forn (i, 0, n) if (i & 1) ans -= C(n, i) * fac[2 * n - 2 * i] * dp[i][m];
				   else ans += C(n, i) * fac[2 * n - 2 * i] * dp[i][m];
	cout << ans.r << '\n';
	return 0;
} 
/*
*/