#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll n,m,k;
ll p[1000001];
ll ways[2005];
ll dp[2005][2005];
ll C[2005];
ll pw(ll x,ll y){
	if(y==0) return 1;
	if(y%2) return x*pw(x,y-1)%mod;
	ll res=pw(x,y/2);
	return res*res%mod;
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin >> n >> m >> k;
	p[0]=1;
	for(int i=1; i<=n ;i++) p[i]=p[i-1]*k%mod;
	C[0]=1;
	for(int i=1; i<=m ;i++) C[i]=C[i-1]*(k-i+1)%mod;
	dp[0][0]=1;
	for(int i=1; i<=m ;i++){
		for(int j=i%2; j<=i ;j+=2){
			if(j!=i) dp[i][j]+=(j+1)*dp[i-1][j+1];
			if(j!=0) dp[i][j]+=dp[i-1][j-1];
			dp[i][j]%=mod;
			//cout << i << ' ' << j << ' ' << dp[i][j] << endl;
		}
	}
	ll ans=0;
	for(int i=0; i*2<=m ;i++){
		for(int r=m%2; r<=m-2*i ;r+=2){
			ways[i]+=dp[m-2*i][r]*C[(m+r)/2];
			ways[i]%=mod;
		}
	}
	for(int i=1; i<=m ;i++) ways[0]=(ways[0]+mod-ways[i])%mod;
	for(int i=0; i*2<=m ;i++){
		ll res=0;
		for(int j=1,len=m; len<=n ;j++,len+=m-i){
			if(j>1 && i==0) continue;
			ll cur=p[n-len]*(n-len+1)%mod;
			//cout << "! " << i <<' ' << j << ' ' << cur << endl;
			if(j%2) res=(res+cur)%mod;
			else res=(res+mod-cur)%mod;
		}
		ans=(ans+res*ways[i])%mod;
	}
	cout << ans << '\n';
}