def cmb(a,b,c):
    b = min(b,a-b)
    num = 1
    for i in range(b):
        num = num*(a-i) % c
    den = 1
    for i in range(b):
        den = den*(i+1) % c
    return num * pow(den,c-2,c) % c
n,m,k = map(int,input().split())
mod = 10**9+7
ans = 0
C = cmb(n*m-2,k-2,mod)
for i in range(1,n):
    ans += i*(n-i)*m**2*C
    ans %= mod
for i in range(1,m):
    ans += i*(m-i)*n**2*C
    ans %= mod
print(ans) def cmb(a,b,c):
    b = min(b,a-b)
    num = 1
    for i in range(b):
        num = num*(a-i) % c
    den = 1
    for i in range(b):
        den = den*(i+1) % c
    return num * pow(den,c-2,c) % c cmb b = min(b,a-b) b min(b,a-b) min b a-b a b num = 1 num 1 for i in range(b):
        num = num*(a-i) % c
     i range(b) range b num = num*(a-i) % c num num*(a-i) % c num*(a-i) num a-i a i c den = 1 den 1 for i in range(b):
        den = den*(i+1) % c
     i range(b) range b den = den*(i+1) % c den den*(i+1) % c den*(i+1) den i+1 i 1 c return num * pow(den,c-2,c) % c num * pow(den,c-2,c) % c num * pow(den,c-2,c) num pow(den,c-2,c) pow den c-2 c 2 c c a a b b c c 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 ans = 0 ans 0 C = cmb(n*m-2,k-2,mod) C cmb(n*m-2,k-2,mod) cmb n*m-2 n*m n m 2 k-2 k 2 mod for i in range(1,n):
    ans += i*(n-i)*m**2*C
    ans %= mod i range(1,n) range 1 n ans += i*(n-i)*m**2*C ans i*(n-i)*m**2*C i*(n-i)*m**2 i*(n-i) i n-i n i m**2 m 2 C ans %= mod ans mod for i in range(1,m):
    ans += i*(m-i)*n**2*C
    ans %= mod i range(1,m) range 1 m ans += i*(m-i)*n**2*C ans i*(m-i)*n**2*C i*(m-i)*n**2 i*(m-i) i m-i m i n**2 n 2 C ans %= mod ans mod print(ans) print ans C = cmb(n*m-2,k-2,mod) cmb(n*m-2,k-2,mod) C ans = 0 0 ans ans += i*(m-i)*n**2*C i*(m-i)*n**2*C ans k = map(int,input().split()) map(int,input().split()) k ans %= mod mod ans ans += i*(n-i)*m**2*C i*(n-i)*m**2*C ans m,k = map(int,input().split()) map(int,input().split()) m def cmb(a,b,c):
    b = min(b,a-b)
    num = 1
    for i in range(b):
        num = num*(a-i) % c
    den = 1
    for i in range(b):
        den = den*(i+1) % c
    return num * pow(den,c-2,c) % c def cmb(a,b,c):
    b = min(b,a-b)
    num = 1
    for i in range(b):
        num = num*(a-i) % c
    den = 1
    for i in range(b):
        den = den*(i+1) % c
    return num * pow(den,c-2,c) % c cmb n,m,k = map(int,input().split()) map(int,input().split()) n mod = 10**9+7 10**9+7 mod ans %= mod mod ans
def cmb(a,b,c):
    b = min(b,a-b)
    num = 1
    for i in range(b):
        num = num*(a-i) % c
    den = 1
    for i in range(b):
        den = den*(i+1) % c
    return num * pow(den,c-2,c) % c
n,m,k = map(int,input().split())
mod = 10**9+7
ans = 0
C = cmb(n*m-2,k-2,mod)
for i in range(1,n):
    ans += i*(n-i)*m**2*C
    ans %= mod
for i in range(1,m):
    ans += i*(m-i)*n**2*C
    ans %= mod
print(ans)
