#include<bits/stdc++.h>
#define N 2005
#define mod 1000000007
using namespace std;
int power(int a,int b){
    int res=1;
    while(b){
        if(b&1) res=1ll*res*a%mod;
        a=1ll*a*a%mod,b>>=1;
    }
    return res;
}
int f[N][N],g[N],fac[N],invf[N],pw[N],ipw[N],pwk[1000005];
int v[N];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    fac[0]=1;
    for(int i=1;i<=m;++i) fac[i]=1ll*fac[i-1]*i%mod;
    invf[m]=power(fac[m],mod-2);
    for(int i=m;i>=1;--i) invf[i-1]=1ll*invf[i]*i%mod;
    pw[0]=1;
    for(int i=1;i<=m;++i) pw[i]=2ll*pw[i-1]%mod;
    ipw[m]=power(pw[m],mod-2);
    for(int i=m;i>=1;--i) ipw[i-1]=2ll*ipw[i]%mod;
    pwk[0]=1;
    for(int i=1;i<=n;++i) pwk[i]=1ll*pwk[i-1]*k%mod; 
    v[0]=1;
    for(int i=1;i<=m;++i)
        v[i]=1ll*v[i-1]*(k-i+1)%mod;
    f[0][0]=1;
    for(int i=1;i<=m;++i)
        for(int j=1;j<=min(i,k);++j){
            f[i][j]=f[i-1][j-1];
            if(i>=2) f[i][j]=(0ll+f[i][j]+1ll*f[i-2][j-1]*(i-1)%mod)%mod;
        }
    int ans=0;
    int nb=0;
    for(int i=1;i<=min(m,k);++i) nb=(0ll+nb+1ll*v[i]*f[m][i]%mod)%mod;
    for(int i=1;i<=m/2;++i){
        int tot=0;
        for(int j=0;i+j<=k&&i*2+j<=m;++j){
            int val=1ll*v[i+j]*f[m-i*2][j]%mod;
            // cerr<<i<<" "<<j<<" "<<v[i+j]<<endl;
            tot=(0ll+tot+val)%mod;
        }
        nb=(0ll+nb-tot+mod)%mod;
        // cerr<<i<<" "<<tot<<endl;
        int len=m;
        while(len<=n){
            ans=(0ll+ans+1ll*pwk[n-len]*(n-len+1)%mod*tot%mod)%mod;
            len+=m-i;
            tot=mod-tot;
        }
    }
    ans=(0ll+ans+1ll*pwk[n-m]*(n-m+1)%mod*nb%mod)%mod;
    cout<<ans<<'\n';
    return 0;
}