//But you can never leave
#include <cstdio>
const int M = 2005;
const int N = M*M;
const int MOD = 1e9+7;
#define int long long
int read()
{
	int x=0,f=1;char c;
	while((c=getchar())<'0' || c>'9') {if(c=='-') f=-1;}
	while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+(c^48);c=getchar();}
	return x*f;
}
int n,k,inv[N],fac[N],dp[M][M];
void init(int n)
{
	inv[0]=inv[1]=fac[0]=1;
	for(int i=2;i<=n;i++) inv[i]=inv[MOD%i]*(MOD-MOD/i)%MOD;
	for(int i=1;i<=n;i++) inv[i]=inv[i-1]*inv[i]%MOD;
	for(int i=1;i<=n;i++) fac[i]=fac[i-1]*i%MOD;
}
int C(int n,int m)
{
	if(m<0 || n<m) return 0;
	return fac[n]*inv[m]%MOD*inv[n-m]%MOD;
}
signed main()
{
	n=read();k=read();init(4e6);
	if(k==1) {puts("1");return 0;}
	dp[0][0]=1;
	for(int i=1;i<=n;i++)
		for(int j=0;j<=i;j++)
		{
			dp[i][j]=dp[i-1][j];
			if(j) dp[i][j]=(dp[i][j]+dp[i][j-1]*(n-j+1)
			%MOD*C(n-i+(n-j+1)*(k-1)-1,k-2))%MOD;
		}
	printf("%lld\n",dp[n][n]);
}