MOD = 10 ** 9 + 7
MAX = 200000 + 5
fact = [1 for _ in range(MAX)]
finv = [1 for _ in range(MAX)]
for i in range(2, MAX):
    fact[i] = fact[i - 1] * i % MOD
    finv[i] = pow(fact[i], MOD-2, MOD)

def comb(n: int, k: int) -> int:
    if n < k or n < 0 or k < 0:
        return 0
    return (fact[n] * finv[k] % MOD) * finv[n-k] % MOD

n, m, k = map(int, input().split())

ans = 0
for i in range(n):
    for j in range(m):
        a = j * (j+1) // 2
        b = (m-1-j) * (m-1-j+1) // 2
        ans += (a + b) * i + m * (i*(i+1)//2) + a
        ans %= MOD

ans *= comb(n*m-2, k-2)
ans %= MOD

print(ans) MOD = 10 ** 9 + 7 MOD 10 ** 9 + 7 10 ** 9 10 9 7 MAX = 200000 + 5 MAX 200000 + 5 200000 5 1 for _ in range(MAX) for _ in range(MAX) _ range(MAX) range MAX for _ in range(MAX) 1 fact = [1 for _ in range(MAX)] fact [1 for _ in range(MAX)] 1 for _ in range(MAX) for _ in range(MAX) _ range(MAX) range MAX for _ in range(MAX) 1 finv = [1 for _ in range(MAX)] finv [1 for _ in range(MAX)] for i in range(2, MAX):
    fact[i] = fact[i - 1] * i % MOD
    finv[i] = pow(fact[i], MOD-2, MOD) i range(2, MAX) range 2 MAX fact[i] = fact[i - 1] * i % MOD fact[i] fact i fact[i - 1] * i % MOD fact[i - 1] * i fact[i - 1] fact i - 1 i 1 i MOD finv[i] = pow(fact[i], MOD-2, MOD) finv[i] finv i pow(fact[i], MOD-2, MOD) pow fact[i] fact i MOD-2 MOD 2 MOD def comb(n: int, k: int) -> int:
    if n < k or n < 0 or k < 0:
        return 0
    return (fact[n] * finv[k] % MOD) * finv[n-k] % MOD comb if n < k or n < 0 or k < 0:
        return 0
     n < k or n < 0 or k < 0 n < k or n < 0 n < k n k n < 0 n 0 k < 0 k 0 return 0 0 return (fact[n] * finv[k] % MOD) * finv[n-k] % MOD (fact[n] * finv[k] % MOD) * finv[n-k] % MOD (fact[n] * finv[k] % MOD) * finv[n-k] fact[n] * finv[k] % MOD fact[n] * finv[k] fact[n] fact n finv[k] finv k MOD finv[n-k] finv n-k n k MOD n: int n k: int k n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k ans = 0 ans 0 for i in range(n):
    for j in range(m):
        a = j * (j+1) // 2
        b = (m-1-j) * (m-1-j+1) // 2
        ans += (a + b) * i + m * (i*(i+1)//2) + a
        ans %= MOD i range(n) range n for j in range(m):
        a = j * (j+1) // 2
        b = (m-1-j) * (m-1-j+1) // 2
        ans += (a + b) * i + m * (i*(i+1)//2) + a
        ans %= MOD j range(m) range m a = j * (j+1) // 2 a j * (j+1) // 2 j * (j+1) j j+1 j 1 2 b = (m-1-j) * (m-1-j+1) // 2 b (m-1-j) * (m-1-j+1) // 2 (m-1-j) * (m-1-j+1) m-1-j m-1 m 1 j m-1-j+1 m-1-j m-1 m 1 j 1 2 ans += (a + b) * i + m * (i*(i+1)//2) + a ans (a + b) * i + m * (i*(i+1)//2) + a (a + b) * i + m * (i*(i+1)//2) (a + b) * i a + b a b i m * (i*(i+1)//2) m i*(i+1)//2 i*(i+1) i i+1 i 1 2 a ans %= MOD ans MOD ans *= comb(n*m-2, k-2) ans comb(n*m-2, k-2) comb n*m-2 n*m n m 2 k-2 k 2 ans %= MOD ans MOD print(ans) print ans MOD = 10 ** 9 + 7 10 ** 9 + 7 MOD ans = 0 0 ans ans %= MOD MOD ans MAX = 200000 + 5 200000 + 5 MAX k = map(int, input().split()) map(int, input().split()) k def comb(n: int, k: int) -> int:
    if n < k or n < 0 or k < 0:
        return 0
    return (fact[n] * finv[k] % MOD) * finv[n-k] % MOD def comb(n: int, k: int) -> int:
    if n < k or n < 0 or k < 0:
        return 0
    return (fact[n] * finv[k] % MOD) * finv[n-k] % MOD comb n, m, k = map(int, input().split()) map(int, input().split()) n a = j * (j+1) // 2 j * (j+1) // 2 a b = (m-1-j) * (m-1-j+1) // 2 (m-1-j) * (m-1-j+1) // 2 b ans %= MOD MOD ans ans += (a + b) * i + m * (i*(i+1)//2) + a (a + b) * i + m * (i*(i+1)//2) + a ans m, k = map(int, input().split()) map(int, input().split()) m ans *= comb(n*m-2, k-2) comb(n*m-2, k-2) ans fact = [1 for _ in range(MAX)] [1 for _ in range(MAX)] fact finv = [1 for _ in range(MAX)] [1 for _ in range(MAX)] finv
MOD = 10 ** 9 + 7
MAX = 200000 + 5
fact = [1 for _ in range(MAX)]
finv = [1 for _ in range(MAX)]
for i in range(2, MAX):
    fact[i] = fact[i - 1] * i % MOD
    finv[i] = pow(fact[i], MOD-2, MOD)

def comb(n: int, k: int) -> int:
    if n < k or n < 0 or k < 0:
        return 0
    return (fact[n] * finv[k] % MOD) * finv[n-k] % MOD

n, m, k = map(int, input().split())

ans = 0
for i in range(n):
    for j in range(m):
        a = j * (j+1) // 2
        b = (m-1-j) * (m-1-j+1) // 2
        ans += (a + b) * i + m * (i*(i+1)//2) + a
        ans %= MOD

ans *= comb(n*m-2, k-2)
ans %= MOD

print(ans)
