#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2005;

namespace ModCalculator {
    const int MOD = 1e9 + 7;
    inline void Inc(int &x, int y) {
        x += y; if (x >= MOD) x -= MOD;
    }
    inline int Add(int x, int y) {
        Inc(x, y); return x;
    }
    inline void Dec(int &x, int y) {
        x -= y; if (x < 0) x += MOD;
    }
    inline int Sub(int x, int y) {
        Dec(x, y); return x;
    }
    inline int Mul(int x, int y) {
        return 1LL * x * y % MOD;
    }
    inline int Ksm(int x, int y) {
        int ret = 1;
        for (; y; y >>= 1) {
            if (y & 1) ret = Mul(ret, x);
            x = Mul(x, x);
        }
        return ret;
    }
}
using namespace ModCalculator;

int n, m, k, C[N][N], fac[N], finv[N], pw2[N], pwk[1000005], dnk[N];
int dp[N];

void solve() {
    scanf("%d %d %d", &n, &m, &k);
    if (k * 2 < m) {
        puts("0");
        return;
    }
    pwk[0] = 1;
    for (int i = 1; i <= n; ++i) {
        pwk[i] = Mul(pwk[i - 1], k);
    }
    dnk[0] = 1;
    for (int i = 1; i <= m; ++i) {
        dnk[i] = Mul(dnk[i - 1], k - i + 1);
    }
    fac[0] = fac[1] = finv[0] = finv[1] = 1;
    pw2[0] = 1; pw2[1] = Ksm(2, MOD - 2);
    for (int i = 2; i <= m; ++i) {
        fac[i] = Mul(fac[i - 1], i);
        finv[i] = Mul(finv[i - 1], Ksm(i, MOD - 2));
        pw2[i] = Mul(pw2[i - 1], pw2[1]);
    }
    for (int i = 0; i <= m; ++i) {
        C[i][0] = 1;
        for (int j = 1; j <= i; ++j) {
            C[i][j] = Add(C[i - 1][j], C[i - 1][j - 1]);
        }
    }

    for (int i = 0; i <= m / 2 && i <= k; ++i) {
        for (int j = 0; j * 2 <= m - i * 2; ++j) {
            int l = m - i * 2 - j * 2;
            int cur = Mul(dnk[i + j + l], finv[i + j + l]);
            cur = Mul(cur, Mul(C[i + j + l][i], fac[i]));
            cur = Mul(cur, Mul(C[j + l][j], fac[m - i * 2]));
            cur = Mul(cur, pw2[j]);
            Inc(dp[i], cur);
        }
    }
    for (int i = 1; i <= m / 2; ++i) {
        Dec(dp[0], dp[i]);
    }
    /*
    for (int i = m / 2 - 1; i >= 0; --i) {
        for (int j = m / 2; j > i; --j) {
            Dec(dp[i], dp[j]);
        }
    }*/
    int ans = Mul(dp[0], Mul(n - m + 1, pwk[n - m]));
    for (int i = 1; i <= m / 2; ++i) {
        for (int j = 1, len = m; len <= n; ++j, len += m - i) {
            int x = n - len, y = m - i - 1, cur = 0;
            if (y >= x) {
                cur = Mul(x + 1, pwk[x]);
            } else if (y * 2 >= x) {
                cur = Mul(y * 2 - x + 1, pwk[x]);
                Inc(cur, Mul(x + 1 - y * 2 + x - 1, Sub(pwk[x], pwk[x - y - 1])));
            } else { //y * 2 < x
                cur = Mul((y + 1) * 2, Sub(pwk[x], pwk[x - y - 1]));
                Inc(cur, Mul(x + 1 - (y + 1) * 2, Sub(Add(pwk[x], pwk[x - (y + 1) * 2]), Mul(2, pwk[x - y - 1]))));
            }
            //cerr << j << ' ' << x << ' ' << y << ' ' << cur << endl;
            Inc(ans, Mul(Mul(dp[i], cur), (j + 1) / 2));
        } 
    }
    printf("%d\n", ans);
}

int main() {
    solve();
    return 0;
}