# E - Cell Distance

n, m, k = map(int, input().split())
mod = 10**9 + 7

difx = 0
dify = 0

for i in range(m):
    difx += (i * (m-i) * pow(n, 2, mod))%mod

for j in range(n):
    dify += (j * (n-j) * pow(m, 2, mod))%mod

def comb_mod(n, r, p):
    num = 1
    den = 1
    r = min(r, n-r)
    for i in range(r):
        num = (num * (n-i))%p
        den = (den * (i+1))%p
    return num * pow(den, p-2, p)  

pat = comb_mod(n*m-2, k-2, mod)

ans = ((difx + dify) * pat)%mod

print(ans) n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 difx = 0 difx 0 dify = 0 dify 0 for i in range(m):
    difx += (i * (m-i) * pow(n, 2, mod))%mod i range(m) range m difx += (i * (m-i) * pow(n, 2, mod))%mod difx (i * (m-i) * pow(n, 2, mod))%mod i * (m-i) * pow(n, 2, mod) i * (m-i) i m-i m i pow(n, 2, mod) pow n 2 mod mod for j in range(n):
    dify += (j * (n-j) * pow(m, 2, mod))%mod j range(n) range n dify += (j * (n-j) * pow(m, 2, mod))%mod dify (j * (n-j) * pow(m, 2, mod))%mod j * (n-j) * pow(m, 2, mod) j * (n-j) j n-j n j pow(m, 2, mod) pow m 2 mod mod def comb_mod(n, r, p):
    num = 1
    den = 1
    r = min(r, n-r)
    for i in range(r):
        num = (num * (n-i))%p
        den = (den * (i+1))%p
    return num * pow(den, p-2, p)   comb_mod num = 1 num 1 den = 1 den 1 r = min(r, n-r) r min(r, n-r) min r n-r n r for i in range(r):
        num = (num * (n-i))%p
        den = (den * (i+1))%p
     i range(r) range r num = (num * (n-i))%p num (num * (n-i))%p num * (n-i) num n-i n i p den = (den * (i+1))%p den (den * (i+1))%p den * (i+1) den i+1 i 1 p return num * pow(den, p-2, p) num * pow(den, p-2, p) num pow(den, p-2, p) pow den p-2 p 2 p n n r r p p pat = comb_mod(n*m-2, k-2, mod) pat comb_mod(n*m-2, k-2, mod) comb_mod n*m-2 n*m n m 2 k-2 k 2 mod ans = ((difx + dify) * pat)%mod ans ((difx + dify) * pat)%mod (difx + dify) * pat difx + dify difx dify pat mod print(ans) print ans k = map(int, input().split()) map(int, input().split()) k dify = 0 0 dify difx = 0 0 difx dify += (j * (n-j) * pow(m, 2, mod))%mod (j * (n-j) * pow(m, 2, mod))%mod dify difx += (i * (m-i) * pow(n, 2, mod))%mod (i * (m-i) * pow(n, 2, mod))%mod difx def comb_mod(n, r, p):
    num = 1
    den = 1
    r = min(r, n-r)
    for i in range(r):
        num = (num * (n-i))%p
        den = (den * (i+1))%p
    return num * pow(den, p-2, p)   def comb_mod(n, r, p):
    num = 1
    den = 1
    r = min(r, n-r)
    for i in range(r):
        num = (num * (n-i))%p
        den = (den * (i+1))%p
    return num * pow(den, p-2, p)   comb_mod m, k = map(int, input().split()) map(int, input().split()) m mod = 10**9 + 7 10**9 + 7 mod ans = ((difx + dify) * pat)%mod ((difx + dify) * pat)%mod ans n, m, k = map(int, input().split()) map(int, input().split()) n pat = comb_mod(n*m-2, k-2, mod) comb_mod(n*m-2, k-2, mod) pat
# E - Cell Distance

n, m, k = map(int, input().split())
mod = 10**9 + 7

difx = 0
dify = 0

for i in range(m):
    difx += (i * (m-i) * pow(n, 2, mod))%mod

for j in range(n):
    dify += (j * (n-j) * pow(m, 2, mod))%mod

def comb_mod(n, r, p):
    num = 1
    den = 1
    r = min(r, n-r)
    for i in range(r):
        num = (num * (n-i))%p
        den = (den * (i+1))%p
    return num * pow(den, p-2, p)  

pat = comb_mod(n*m-2, k-2, mod)

ans = ((difx + dify) * pat)%mod

print(ans)
