# E - Cell Distance
# https://atcoder.jp/contests/abc127/tasks/abc127_e

def comb(n,k,mod):
    if n<k:
        return 0
    if n<0 or k<0:
        return 0
    k=min(n-k,k)
    ans=1
    inv=[1]*(k+1)
    if k>=1:
        ans*=(n-k+1)%mod
    for i in range(2,k+1):
        inv[i]=mod-inv[mod%i]*(mod//i)%mod
        ans=ans*(n-k+i)*inv[i]%mod
    return ans

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

MOD = 1000000007

distX = 0
for d in range(n):
    distX += d * (n - d) * m ** 2

distY = 0
for d in range(m):
    distY += d * (m - d) * n ** 2

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

print(ans) def comb(n,k,mod):
    if n<k:
        return 0
    if n<0 or k<0:
        return 0
    k=min(n-k,k)
    ans=1
    inv=[1]*(k+1)
    if k>=1:
        ans*=(n-k+1)%mod
    for i in range(2,k+1):
        inv[i]=mod-inv[mod%i]*(mod//i)%mod
        ans=ans*(n-k+i)*inv[i]%mod
    return ans comb if n<k:
        return 0
     n<k n k return 0 0 if n<0 or k<0:
        return 0
     n<0 or k<0 n<0 n 0 k<0 k 0 return 0 0 k=min(n-k,k) k min(n-k,k) min n-k n k k ans=1 ans 1 inv=[1]*(k+1) inv [1]*(k+1) [1] 1 k+1 k 1 if k>=1:
        ans*=(n-k+1)%mod
     k>=1 k 1 ans*=(n-k+1)%mod ans (n-k+1)%mod n-k+1 n-k n k 1 mod for i in range(2,k+1):
        inv[i]=mod-inv[mod%i]*(mod//i)%mod
        ans=ans*(n-k+i)*inv[i]%mod
     i range(2,k+1) range 2 k+1 k 1 inv[i]=mod-inv[mod%i]*(mod//i)%mod inv[i] inv i mod-inv[mod%i]*(mod//i)%mod mod inv[mod%i]*(mod//i)%mod inv[mod%i]*(mod//i) inv[mod%i] inv mod%i mod i mod//i mod i mod ans=ans*(n-k+i)*inv[i]%mod ans ans*(n-k+i)*inv[i]%mod ans*(n-k+i)*inv[i] ans*(n-k+i) ans n-k+i n-k n k i inv[i] inv i mod return ans ans n n k k mod mod n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k MOD = 1000000007 MOD 1000000007 distX = 0 distX 0 for d in range(n):
    distX += d * (n - d) * m ** 2 d range(n) range n distX += d * (n - d) * m ** 2 distX d * (n - d) * m ** 2 d * (n - d) d n - d n d m ** 2 m 2 distY = 0 distY 0 for d in range(m):
    distY += d * (m - d) * n ** 2 d range(m) range m distY += d * (m - d) * n ** 2 distY d * (m - d) * n ** 2 d * (m - d) d m - d m d n ** 2 n 2 ans = ((distX + distY) * comb(n * m - 2, k - 2, MOD)) % MOD ans ((distX + distY) * comb(n * m - 2, k - 2, MOD)) % MOD (distX + distY) * comb(n * m - 2, k - 2, MOD) distX + distY distX distY comb(n * m - 2, k - 2, MOD) comb n * m - 2 n * m n m 2 k - 2 k 2 MOD MOD print(ans) print ans distX += d * (n - d) * m ** 2 d * (n - d) * m ** 2 distX distY += d * (m - d) * n ** 2 d * (m - d) * n ** 2 distY def comb(n,k,mod):
    if n<k:
        return 0
    if n<0 or k<0:
        return 0
    k=min(n-k,k)
    ans=1
    inv=[1]*(k+1)
    if k>=1:
        ans*=(n-k+1)%mod
    for i in range(2,k+1):
        inv[i]=mod-inv[mod%i]*(mod//i)%mod
        ans=ans*(n-k+i)*inv[i]%mod
    return ans def comb(n,k,mod):
    if n<k:
        return 0
    if n<0 or k<0:
        return 0
    k=min(n-k,k)
    ans=1
    inv=[1]*(k+1)
    if k>=1:
        ans*=(n-k+1)%mod
    for i in range(2,k+1):
        inv[i]=mod-inv[mod%i]*(mod//i)%mod
        ans=ans*(n-k+i)*inv[i]%mod
    return ans comb n, m, k = map(int, input().split()) map(int, input().split()) n ans = ((distX + distY) * comb(n * m - 2, k - 2, MOD)) % MOD ((distX + distY) * comb(n * m - 2, k - 2, MOD)) % MOD ans MOD = 1000000007 1000000007 MOD k = map(int, input().split()) map(int, input().split()) k distY = 0 0 distY m, k = map(int, input().split()) map(int, input().split()) m distX = 0 0 distX
# E - Cell Distance
# https://atcoder.jp/contests/abc127/tasks/abc127_e

def comb(n,k,mod):
    if n<k:
        return 0
    if n<0 or k<0:
        return 0
    k=min(n-k,k)
    ans=1
    inv=[1]*(k+1)
    if k>=1:
        ans*=(n-k+1)%mod
    for i in range(2,k+1):
        inv[i]=mod-inv[mod%i]*(mod//i)%mod
        ans=ans*(n-k+i)*inv[i]%mod
    return ans

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

MOD = 1000000007

distX = 0
for d in range(n):
    distX += d * (n - d) * m ** 2

distY = 0
for d in range(m):
    distY += d * (m - d) * n ** 2

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

print(ans)