#include<bits/stdc++.h>
using namespace std;
constexpr int M=2005,mod=1e9+7;
int n,m,N;long long ans;
int f[M],g[M],pw[M],fac[M],ifac[M],coef[M];
int qpow(int x,int n){
    int s=1; while (n){
        if (n&1) s=1ll*s*x%mod;
        x=1ll*x*x%mod; n>>=1;
    } return s;
}
int rdc(int x){return x>=mod?x-mod:x;}
void init(){
    for (int i=pw[0]=1;i<=n;i++) pw[i]=rdc(pw[i-1]<<1);
    for (int i=fac[0]=1;i<=n;i++) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[n]=qpow(fac[n],mod-2);
    for (int i=n;i;i--) ifac[i-1]=1ll*ifac[i]*i%mod;
    for (int i=coef[0]=1;i<=n;i++) coef[i]=1ll*coef[i-1]*(i*2-1)%mod;
}
int c(int n,int m){return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;}
int main(){
    scanf("%d%d",&n,&m);
    init();f[0]=1;N=n<<1;
    for (int i=0,sum=0;i<m;i++){
        int len=i<N%m?N/m+1:N/m;
        for (int j=0;j<=sum;j++) g[j]=f[j],f[j]=0;
        for (int j=0;j<=sum;j++)
            for (int k=0;k*2<=len;k++)
                f[j+k]=(f[j+k]+1ll*g[j]*coef[k]%mod*c(len,k<<1))%mod;
        sum+=len>>1;
    }
    for (int i=0;i<=n;i++){
        int rec=1ll*f[i]*coef[n-i]%mod;
        ans+=i&1?-rec:rec;
    }
    ans%=mod;if (ans<0) ans+=mod;
    printf("%d\n",1ll*ans*fac[n]%mod*pw[n]%mod);
    return 0;
}