#include<iostream>
#include<cstdio>
#define N 4000
#define mod 1000000007
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int n,m,C[N+1][N+1],fac[N+1],invfac[N+1],cnt[N+1],dp[N+1],F[N+1],res,ans;
int main()
{
	fac[0]=1;
	for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
	invfac[N]=fast_pow(fac[N],mod-2);
	for (int i=N-1;i>=0;--i) invfac[i]=1ll*invfac[i+1]*(i+1)%mod;
	for (int i=0;i<=N;++i)
		for (int j=0;j<=i;++j)
			C[i][j]=1ll*fac[i]*invfac[j]%mod*invfac[i-j]%mod;
	n=read(),m=read();
	for (int i=1;i<=(n<<1);++i) cnt[i%m]++;
	dp[0]=1;
	for (int i=0;i<m;++i)
	{
		for (int j=0;j<=res+(cnt[i]>>1);++j) F[j]=0;
		for (int j=0;(j<<1)<=cnt[i];++j)
			for (int k=0;k<=res;++k)
				Adder(F[j+k],1ll*dp[k]*C[cnt[i]][j<<1]%mod*fac[j<<1]%mod*invfac[j]%mod);
		res+=(cnt[i]>>1);
		for (int j=0;j<=res;++j) dp[j]=F[j];
	}
	for (int i=0;i<=res;++i)
	{
		if (!(i&1)) Adder(ans,1ll*dp[i]*C[n][i]%mod*fac[i]%mod*fac[(n<<1)-(i<<1)]%mod);
		else Adder2(ans,-1ll*dp[i]*C[n][i]%mod*fac[i]%mod*fac[(n<<1)-(i<<1)]%mod);
	}
	printf("%d\n",ans);
	return 0;
}