#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;

int n, m, k, gf[1000005], dp[2005][2005];
int countp(int a, int b) {
    if(b * 2 < a || b > a) return 0;
    return dp[a][b];
}
int countb(int b) {
    int coef = 1, ret = 0;
    for(int i = 0; i < b; i++)
        coef = 1LL * coef * (k - i) % MOD;
    for(int i = 0; i <= m - 2 * b; i++) {
        ret = (ret + 1LL * coef * countp(m - 2 * b, i)) % MOD;
        coef = 1LL * coef * (k - b - i) % MOD;
    }
    if(b == 0)
        for(int i = 1; i * 2 <= m; i++)
            ret = (ret + MOD - countb(i)) % MOD;
    return ret;
}
int counts(int b) {
    if(b == 0) return gf[n];
    int coef = 1, ret = 0;
    for(int i = n; i >= 0; i -= m - b) {
        ret = (ret + 1LL * coef * gf[i]) % MOD;
        coef = MOD - coef;
    }
    return ret;
}
int main() {
    scanf("%d%d%d", &n, &m, &k);
    n -= m;
    gf[0] = 1;
    for(int i = 1; i <= n; i++) gf[i] = 1LL * gf[i - 1] * k % MOD;
    for(int i = 1; i <= n; i++) gf[i] = 1LL * gf[i] * (i + 1) % MOD;

    dp[0][0] = 1;
    for(int i = 1; i <= m; i++)
        for(int j = 1; j <= m; j++) {
            dp[i][j] = dp[i - 1][j - 1];
            if(i >= 2) dp[i][j] = (dp[i][j] + 1LL * dp[i - 2][j - 1] * (i - 1)) % MOD;
        }
    int ans = 0;
    for(int b = 0; b * 2 <= m; b++)
        ans = (ans + 1LL * countb(b) * counts(b)) % MOD;
    printf("%d\n", ans);
    return 0;
}