#include<bits/stdc++.h>
#define mod 1000000007
#define N 2005
using namespace std;
int n,m,k,A[N];
int md(int x){
	return x>=mod?x-mod:x;
}
int power(int x,int y){
	int res=1;
	while(y){
		if(y&1) res=1ll*res*x%mod;
		x=1ll*x*x%mod;
		y=y/2;
	}
	return res;
}
int fac[N],ifac[N],ipw2[N],pwr[1000005],ans;
int C(int x,int y){
	return 1ll*fac[x]*ifac[y]%mod*ifac[x-y]%mod;
}
int main(){
	scanf("%d%d%d",&n,&m,&k);
	fac[0]=1;
	for(int i=1;i<=m;i++) fac[i]=1ll*fac[i-1]*i%mod;
	ifac[m]=power(fac[m],mod-2);
	for(int i=m;i>=1;i--) ifac[i-1]=1ll*ifac[i]*i%mod;
	A[0]=1;
	for(int i=1;i<=m;i++) A[i]=1ll*A[i-1]*(k-i+1)%mod;
	ipw2[0]=1;
	for(int i=1;i<=m;i++) ipw2[i]=1ll*ipw2[i-1]*ifac[2]%mod;
	pwr[0]=1;
	for(int i=1;i<=n;i++) pwr[i]=1ll*pwr[i-1]*k%mod;
	for(int i=m/2,sm=0;i>=0;i--){
		int wp=0;
		for(int j=0;j*2+i*2<=m;j++){
			wp=(wp+1ll*C(m-2*i,2*j)*fac[2*j]%mod*ipw2[j]%mod*ifac[j]%mod*A[m-i-j])%mod;
		}
		if(i){
			sm=md(sm+wp);
			int an=0;
			for(int j=1,l=m;l<=n;j++,l+=(m-i)){
				int w=1ll*(n-l+1)*pwr[n-l]%mod;
				if(j&1) an=md(an+w);
				else an=md(an-w+mod);
			}
			ans=(ans+1ll*an*wp)%mod;
		}
		else{
			wp=(wp-sm+mod);
			ans=(ans+1ll*(n-m+1)*pwr[n-m]%mod*wp)%mod;
		}
	}
	printf("%d",ans);
}