#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;

cs int N = 1e6 + 5, M = 2e3 + 5; 
cs int mod = 1e9 + 7;
int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b; 
}
int dec(int a, int b) {
    return a - b < 0 ? a - b + mod : a - b; 
}
int mul(int a, int b) {
    return 1ll * a * b % mod;
}
void Add(int &a , int b) {
    a = add(a, b);
}
void Dec(int &a, int b) {
    a = dec(a, b);
}
void Mul(int &a, int b) {
    a = mul(a, b);
}
int ksm(int a, int b) {
    int c = 1;
    for(; b; b >>= 1, Mul(a, a))
    if(b & 1) Mul(c, a);
    return c; 
}
int n, m, k; 
int fc[M], ifc[M];
void init(int n) {
    fc[0] = ifc[0] = 1; 
    for(int i = 1; i <= n; i++) 
        fc[i] = mul(fc[i - 1], i);
    ifc[n] = ksm(fc[n], mod - 2);
    for(int i = n - 1; i; i--) 
        ifc[i] = mul(ifc[i + 1], i + 1);
}
int F(int a, int b) {
    int coef = 1, ans = 0;
    for(int i = 0; i < min(a, b); i++) Mul(coef, b - i);
    // cout << a << ' ' << b << ' ' << coef <<  endl;
    for(int i = 0; i * 2 <= a; i++) {
        if(a - i > b) continue; 
        // b ^ {a - i}
        int c = mul(ifc[i], ifc[a - 2 * i]);
        Mul(c, ksm(2, mod - 1 - i));
        // cout << "Ffdsfasfsdafasdf " <<i << ' ' << coef << ' ' << c << endl;
        Add(ans, mul(coef, c));
        Mul(coef, ksm(b - (a - i) + 1, mod - 2));
    }
    Mul(ans, fc[a]);
    // cout << "---------------------- " << a << ' ' << b << ' ' << ans << endl;
    return ans; 
}
int calc(int l) {
    int ans = 0; 
    for(int c = 1; c <= n; c++) {
        int len = c * m - (c - 1) * l;
        if(len > n) break;
        if(c & 1) Add(ans, mul(n - len + 1, ksm(k, n - len)));
        else Dec(ans, mul(n - len + 1, ksm(k, n - len)));
    }
    return ans;
}
void Main() {
    cin >> n >> m >> k; 
    init(m);
    int coef = k; 
    int temp = mul(n - m + 1, ksm(k, n - m));
    int ans = mul(temp, F(m, k));
    // cout << temp << ' ' << ans << endl;
    for(int l = 1; l * 2 <= m; l++) {
        int c = mul(coef, F(m - 2 * l, k - l));
        // cout << "FFF " << l << ' ' << coef << ' ' << F(m - 2 * l, k - l) << ' ' << c << endl;
        Add(ans, mul(c, dec(calc(l), temp)));
        // cout << "GGG " << calc(l) << endl;
        Mul(coef, k - l);
    }
    cout << ans << '\n';
}
int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    ios :: sync_with_stdio(0), cin.tie(0);
    int T = 1; 
    while(T--) Main();
    return 0; 
}