//Shirosaki Hana kawaii
#include<bits/stdc++.h>
#define int long long
const int mod=1e9+7;
using namespace std;
inline int read(){
	int x=0,f=1; char ch=getchar();
	for (;ch<'0'||ch>'9';ch=getchar())
		if (ch=='-') f=-1;
	for (;ch>='0'&&ch<='9';ch=getchar())
		x=(x<<1)+(x<<3)+(ch^48);
	return x*f;
}
int n,m,K,d[105][105],fac[205],inv[205],res=1,op=1;
void roll(int i,int j){ swap(d[i],d[j]),op=-op; }
inline int kkk(int a,int b){
	int ret=1;
	for (;b;b>>=1,a=a*a%mod)
		if (b&1) ret=ret*a%mod;
	return ret;
}
inline void init(int N){
	fac[0]=1;
	for (int i=1;i<=N;i++)
		fac[i]=fac[i-1]*i%mod;
	inv[N]=kkk(fac[N],mod-2);
	for (int i=N;i>=1;i--)
		inv[i-1]=inv[i]*i%mod;
}
inline int C(int n,int m){
	return fac[n]*inv[n-m]%mod*inv[m]%mod;
}
signed main(){
	n=read(),m=read(),K=read(),init(n+m);
	for (int i=1;i<=K;i++)
	for (int j=1;j<=K;j++)
		d[i][j]=C(n+m,n+i-j);
	for (int i=1;i<=K;i++)
	for (int j=i+1;j<=K;roll(i,j++))
	for (int k,v;d[i][i];roll(i,j))
		for (k=i,v=d[j][i]/d[i][i];k<=K;k++)
			d[j][k]=(d[j][k]-v*d[i][k]%mod+mod)%mod;
	for (int i=1;i<=K;i++) res=res*d[i][i]%mod;
	printf("%lld",(res*op+mod)%mod);
	return 0;
}