#include<stdio.h>
#include<algorithm>
typedef unsigned int uint;
typedef unsigned long long ull;
constexpr uint mod{1000000007};
constexpr uint plus(const uint &x,const uint &y) {
    if(x+y>=mod) {
        return x+y-mod;
    }
    return x+y;
}
constexpr uint minus(const uint &x,const uint &y) {
    if(x<y) {
        return x-y+mod;
    }
    return x-y;
}
constexpr uint power(uint x,uint y) {
    uint s(1);
    while(y>0) {
        if(y&1) {
            s=ull(s)*x%mod;
        }
        x=ull(x)*x%mod;
        y>>=1;
    }
    return s;
}
uint inv[2005],invk[4005];
uint fac[2005],ifac[2005],ifac2[2005];
uint powk[1000005];
int main() {
    int n,m,k;
    scanf("%d%d%d",&n,&m,&k);
    if(k<<1<m) {
        return puts("0"),0;
    }
    inv[0]=0,inv[1]=1;
    for(int i=2;i<=m;i++) {
        const int j(mod/i+1);
        inv[i]=ull(j)*inv[i*j-mod]%mod;
    }
    for(int i=0;i<=m<<1&&i<=k;i++) {
        invk[i]=power(k-i,mod-2);
    }
    fac[0]=1;
    for(int i=1;i<=m;i++) {
        fac[i]=ull(fac[i-1])*i%mod;
    }
    ifac[m]=power(fac[m],mod-2);
    for(int i=m;i>=1;i--) {
        ifac[i-1]=ull(ifac[i])*i%mod;
    }
    for(int i=0;i<=m;i++) {
        ifac2[i]=ull(ifac[i])*ifac[i]%mod;
    }
    powk[0]=1;
    for(int i=1;i<=n;i++) {
        powk[i]=ull(powk[i-1])*k%mod;
    }
    const auto calc([&](const int &m,const int &k,const int &d)->uint {
        int i(std::max(0,m-k));
        if(i>k||i<<1>m) {
            return 0;
        }
        uint res(0),coef(1);
        for(int j=0;j!=m-(i<<1);j++) {
            coef=ull(coef)*(k-i-j)%mod;
        }
        for(int j=0;j!=i;j++) {
            coef=ull(coef)*(k-j)%mod*power(2,mod-2)%mod;
        }
        for(;i<=k&&i<<1<=m;i++) {
            res=(res+ull(coef)*ifac[i]%mod*ifac[m-(i<<1)])%mod;
            coef=ull(coef)*(k-i)%mod*invk[d+i]%mod*invk[d+m-i-1]%mod*power(2,mod-2)%mod;
        }
        res=ull(res)*fac[m]%mod;
        return res;
    });
    uint ans(0);
    uint coef(1),sum(calc(m,k,0));
    for(int i=1;i<<1<=m;i++) {
        coef=ull(coef)*(k-i+1)%mod;
        const uint cnt(ull(coef)*(calc(m-(i<<1),k-i,i))%mod);
        sum=minus(sum,cnt);
        uint tmp(0);
        for(int j=0,l=m;l<=n;j^=1,l+=m-i) {
            tmp=(tmp+ull(j?mod-(n-l+1):n-l+1)*powk[n-l])%mod;
        }
        ans=(ans+ull(cnt)*tmp)%mod;
    }
    ans=(ans+ull(sum)*(n-m+1)%mod*powk[n-m])%mod;
    printf("%u\n",ans);
    return 0;
}