// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 2e3 + 5, SIZE = MAXN * MAXN;
const int MOD = 1e9 + 7;

int N, K;

void input()
{
    read(N); read(K);
}

LL fpm(LL base, LL exp)
{
    LL ret = 1;
    for (; exp; exp >>= 1) {
        if (exp & 1)
            (ret *= base) %= MOD;
        (base *= base) %= MOD;
    }
    return ret;
}

int fac[SIZE], ifac[SIZE];

inline int C(int n, int k)
{
    assert(0 <= k && k <= n);
    return (LL)fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;
}

void solve()
{
    if (K == 1) {
        puts("1");
        return;
    }

    int max = N * K;

    fac[0] = 1;
    for (int i = 1; i <= max; ++i) {
        fac[i] = (LL)fac[i - 1] * i % MOD;
    }
    ifac[max] = fpm(fac[max], MOD - 2);
    for (int i = max; i >= 1; --i) {
        ifac[i - 1] = (LL)ifac[i] * i % MOD;
    }

    static int dp[MAXN][MAXN];

    dp[0][0] = 1;
    for (int i = 0; i <= N; ++i) {
        for (int j = 0; j <= i; ++j) {
            (dp[i + 1][j] += dp[i][j]) %= MOD;
            if (j < i)
                (dp[i][j + 1] += (LL)dp[i][j] * C((K - 1) * (N - j) + N - i - 1, K - 2) % MOD) %= MOD;
        }
    }
    int ans = (LL)dp[N][N] * fac[N] % MOD;

    printf("%d\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("F.in", "r", stdin);
    freopen("F.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 相思黄叶落，白露湿青苔。
//     -- 李白《长相思三首》


Measured memory_bytes: 47360