n,m,k=map(int,input().split())
M=10**9+7
N=n+m
fa=[1]
for i in range(1,N+1):
  fa+=[fa[-1]*i%M]
fb=[pow(fa[N],M-2,M)]
for i in reversed(range(1,N+1)):
  fb+=[fb[-1]*i%M]
fb.reverse()
fc=lambda n,k:fa[n]*fb[k]*fb[n-k]%M if n>=k>=0 else 0
a=0
for i in range(1,(n+m-k)//2+1):
  a+=(fc(n-1,i-1)+fc(n-1,i))*fa[n-1]*fc(m-1,i-1)*fa[m]
  a%=M
print(a)