N = 10**6 mod = 10**9+7 fac = [1]*(N+1) finv = [1]*(N+1) for i in range(N): fac[i+1] = fac[i] * (i+1) % mod finv[-1] = pow(fac[-1], mod-2, mod) for i in reversed(range(N)): finv[i] = finv[i+1] * (i+1) % mod def cmb1(n, r, mod): if r <0 or r > n: return 0 r = min(r, n-r) return fac[n] * finv[r] * finv[n-r] % mod n, m, k = map(int, input().split()) mod = 10**9+7 ans = 0 for i in range(1, n+1): if i-1 > m-1: continue if n+m-2*i < k: continue ans += cmb1(n, i, mod)*cmb1(m-1, i-1, mod)*fac[m]*fac[n-1] ans %= mod print(ans)