import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7

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

def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret

ans = m*n*(m+n)*(m*n-1)//3

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

print(ans)
 import sys sys readline = sys.stdin.readline readline sys.stdin.readline sys.stdin sys stdin readline sys.setrecursionlimit(10**8) sys.setrecursionlimit sys setrecursionlimit 10**8 10 8 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 INF = 10**18 INF 10**18 10 18 eps = 10**-7 eps 10**-7 10 -7 m,n,k = map(int,readline().split()) m map(int,readline().split()) map int readline().split() ().split () readline split n k def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret comb r = min(r, n-r) r min(r, n-r) min r n-r n r mol = 1 mol 1 deno = 1 deno 1 for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
     i range(1, r+1) range 1 r+1 r 1 mol = mol * (n-r+i) % mod mol mol * (n-r+i) % mod mol * (n-r+i) mol n-r+i n-r n r i mod deno = deno * i % mod deno deno * i % mod deno * i deno i mod ret = mol * pow(deno, mod-2, mod) % mod ret mol * pow(deno, mod-2, mod) % mod mol * pow(deno, mod-2, mod) mol pow(deno, mod-2, mod) pow deno mod-2 mod 2 mod mod return ret ret n n r r mod mod ans = m*n*(m+n)*(m*n-1)//3 ans m*n*(m+n)*(m*n-1)//3 m*n*(m+n)*(m*n-1) m*n*(m+n) m*n m n m+n m n m*n-1 m*n m n 1 3 ans = (ans * comb(m*n-2,k-2,mod))%mod ans (ans * comb(m*n-2,k-2,mod))%mod ans * comb(m*n-2,k-2,mod) ans comb(m*n-2,k-2,mod) comb m*n-2 m*n m n 2 k-2 k 2 mod mod ans = ans*pow(2,mod-2,mod)%mod ans ans*pow(2,mod-2,mod)%mod ans*pow(2,mod-2,mod) ans pow(2,mod-2,mod) pow 2 mod-2 mod 2 mod mod print(ans) print ans mod = 10**9+7 10**9+7 mod ans = (ans * comb(m*n-2,k-2,mod))%mod (ans * comb(m*n-2,k-2,mod))%mod ans m,n,k = map(int,readline().split()) map(int,readline().split()) m ans = m*n*(m+n)*(m*n-1)//3 m*n*(m+n)*(m*n-1)//3 ans readline = sys.stdin.readline sys.stdin.readline readline INF = 10**18 10**18 INF ans = ans*pow(2,mod-2,mod)%mod ans*pow(2,mod-2,mod)%mod ans n,k = map(int,readline().split()) map(int,readline().split()) n k = map(int,readline().split()) map(int,readline().split()) k eps = 10**-7 10**-7 eps def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret comb
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7

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

def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret

ans = m*n*(m+n)*(m*n-1)//3

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

print(ans)

