MOD = 10 ** 9 + 7
INF = 10 ** 13
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

MAXN = 100005
factorial = [1]
for i in range(1, MAXN + 1):
    factorial.append(factorial[-1] * i % MOD)

inv_factorial = [-1] * (MAXN + 1)
inv_factorial[-1] = pow(factorial[-1], MOD-2, MOD)
for i in reversed(range(MAXN)):
    inv_factorial[i] = inv_factorial[i + 1] * (i + 1) % MOD

def fact(n):
    return factorial[n]%MOD

def nck(n, k):
    if k>n or k<0:
        return 0
    else:
        return factorial[n] * inv_factorial[n-k] * inv_factorial[k]%MOD

def main():
    N,M,K = map(int,input().split())
    ans = 0
    p = min((N + M - K)//2,N)
    for i in range(1,p + 1):
        ans += nck(N,i)*nck(M - 1,i - 1)%MOD
        ans %= MOD
    ans *= fact(N - 1)*fact(M)%MOD
    ans %= MOD
    print(ans)   
if __name__ == '__main__':
    main()