#include<bits/stdc++.h>
using namespace std;
const int N=1005,mod=1e9+7;
int n,m,k,fac[N],inv[N],e[N][N];
int ksm(int a,int b=mod-2){int s=1;
	for(;b;b>>=1,a=1ll*a*a%mod)if(b&1)s=1ll*s*a%mod;
	return s;
}
void qm(int &x,int y){x+=y;if(x>=mod)x-=mod;}
int det(int a[N][N],int n){int sum=1;
	for(int i=1;i<=n;i++){int p=i;
		for(int j=i;j<=n;j++)if(a[j][i]){p=j;break ;}
		if(p!=i)swap(a[p],a[i]),sum=-sum;
		int tmp=ksm(a[i][i]);
		for(int j=i+1;j<=n;j++){
			int x=1ll*a[j][i]*tmp%mod;
			for(int k=i;k<=n;k++)qm(a[j][k],mod-1ll*x*a[i][k]%mod);
		}
		sum=1ll*a[i][i]*sum%mod;
	}
	return (sum+mod)%mod;	
}
int C(int n,int m){return 1ll*fac[n]*inv[n-m]%mod*inv[m]%mod;} 
int main(){fac[0]=1;
	for(int i=1;i<=N-1;i++)fac[i]=1ll*fac[i-1]*i%mod;
	inv[N-1]=ksm(fac[N-1]);
	for(int i=N-1;i>=1;i--)inv[i-1]=1ll*inv[i]*i%mod;
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=k;i++){
		int x=0-i+1,y=0+i-1;
		for(int j=1;j<=k;j++){
			int a=n-j+1,b=m+j-1;
			if(x<=a&&y<=b)e[i][j]=C(a-x+b-y,a-x);
		}
	}
	printf("%d\n",det(e,k));
	return 0;
}