mod = 10**9+7
inv_2 = pow(2, mod-2, mod)
N, M, K = map(int, input().split())
def make_fact(n):#0~nの階乗を求める
    fact = [1]*(n+1)
    for i in range(1, n+1):
        fact[i] = fact[i-1]*i%mod
    return fact

def make_fact_inv(n):#0~nの階乗のmodに関する逆元を求める
    fact_inv = [1]*(n+1)
    fact_inv[n] = pow(fact[n], mod-2, mod)#フェルマーの小定理
    for i in range(n, 0, -1):
        fact_inv[i-1] = fact_inv[i]*i%mod
    return fact_inv

def comb(n, k):#nCk
    return fact[n]*fact_inv[k]*fact_inv[n-k]%mod
fact = make_fact(N*M)
fact_inv = make_fact_inv(N*M)
Sum = [0]*(max(N, M)+1)
for i in range(1, len(Sum)):
    Sum[i] = (Sum[i-1]+i)%mod
ans = 0

for x in range(1, N+1):
    for y in range(1, M+1):
        ans+=(Sum[x-1]+Sum[N-x])*M+(Sum[y-1]+Sum[M-y])*N
        ans%=mod
print(ans*comb(N*M-2, K-2)*inv_2%mod) mod = 10**9+7 mod 10**9+7 10**9 10 9 7 inv_2 = pow(2, mod-2, mod) inv_2 pow(2, mod-2, mod) pow 2 mod-2 mod 2 mod N, M, K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split M K def make_fact(n):#0~nの階乗を求める
    fact = [1]*(n+1)
    for i in range(1, n+1):
        fact[i] = fact[i-1]*i%mod
    return fact make_fact fact = [1]*(n+1) fact [1]*(n+1) [1] 1 n+1 n 1 for i in range(1, n+1):
        fact[i] = fact[i-1]*i%mod
     i range(1, n+1) range 1 n+1 n 1 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 return fact fact n n def make_fact_inv(n):#0~nの階乗のmodに関する逆元を求める
    fact_inv = [1]*(n+1)
    fact_inv[n] = pow(fact[n], mod-2, mod)#フェルマーの小定理
    for i in range(n, 0, -1):
        fact_inv[i-1] = fact_inv[i]*i%mod
    return fact_inv make_fact_inv fact_inv = [1]*(n+1) fact_inv [1]*(n+1) [1] 1 n+1 n 1 fact_inv[n] = pow(fact[n], mod-2, mod) fact_inv[n] fact_inv n pow(fact[n], mod-2, mod) pow fact[n] fact n mod-2 mod 2 mod for i in range(n, 0, -1):
        fact_inv[i-1] = fact_inv[i]*i%mod
     i range(n, 0, -1) range n 0 -1 fact_inv[i-1] = fact_inv[i]*i%mod fact_inv[i-1] fact_inv i-1 i 1 fact_inv[i]*i%mod fact_inv[i]*i fact_inv[i] fact_inv i i mod return fact_inv fact_inv n n def comb(n, k):#nCk
    return fact[n]*fact_inv[k]*fact_inv[n-k]%mod comb return fact[n]*fact_inv[k]*fact_inv[n-k]%mod fact[n]*fact_inv[k]*fact_inv[n-k]%mod fact[n]*fact_inv[k]*fact_inv[n-k] fact[n]*fact_inv[k] fact[n] fact n fact_inv[k] fact_inv k fact_inv[n-k] fact_inv n-k n k mod n n k k fact = make_fact(N*M) fact make_fact(N*M) make_fact N*M N M fact_inv = make_fact_inv(N*M) fact_inv make_fact_inv(N*M) make_fact_inv N*M N M Sum = [0]*(max(N, M)+1) Sum [0]*(max(N, M)+1) [0] 0 max(N, M)+1 max(N, M) max N M 1 for i in range(1, len(Sum)):
    Sum[i] = (Sum[i-1]+i)%mod i range(1, len(Sum)) range 1 len(Sum) len Sum Sum[i] = (Sum[i-1]+i)%mod Sum[i] Sum i (Sum[i-1]+i)%mod Sum[i-1]+i Sum[i-1] Sum i-1 i 1 i mod ans = 0 ans 0 for x in range(1, N+1):
    for y in range(1, M+1):
        ans+=(Sum[x-1]+Sum[N-x])*M+(Sum[y-1]+Sum[M-y])*N
        ans%=mod x range(1, N+1) range 1 N+1 N 1 for y in range(1, M+1):
        ans+=(Sum[x-1]+Sum[N-x])*M+(Sum[y-1]+Sum[M-y])*N
        ans%=mod y range(1, M+1) range 1 M+1 M 1 ans+=(Sum[x-1]+Sum[N-x])*M+(Sum[y-1]+Sum[M-y])*N ans (Sum[x-1]+Sum[N-x])*M+(Sum[y-1]+Sum[M-y])*N (Sum[x-1]+Sum[N-x])*M Sum[x-1]+Sum[N-x] Sum[x-1] Sum x-1 x 1 Sum[N-x] Sum N-x N x M (Sum[y-1]+Sum[M-y])*N Sum[y-1]+Sum[M-y] Sum[y-1] Sum y-1 y 1 Sum[M-y] Sum M-y M y N ans%=mod ans mod print(ans*comb(N*M-2, K-2)*inv_2%mod) print ans*comb(N*M-2, K-2)*inv_2%mod ans*comb(N*M-2, K-2)*inv_2 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 inv_2 mod fact = make_fact(N*M) make_fact(N*M) fact def make_fact(n):#0~nの階乗を求める
    fact = [1]*(n+1)
    for i in range(1, n+1):
        fact[i] = fact[i-1]*i%mod
    return fact def make_fact(n):#0~nの階乗を求める
    fact = [1]*(n+1)
    for i in range(1, n+1):
        fact[i] = fact[i-1]*i%mod
    return fact make_fact def make_fact_inv(n):#0~nの階乗のmodに関する逆元を求める
    fact_inv = [1]*(n+1)
    fact_inv[n] = pow(fact[n], mod-2, mod)#フェルマーの小定理
    for i in range(n, 0, -1):
        fact_inv[i-1] = fact_inv[i]*i%mod
    return fact_inv def make_fact_inv(n):#0~nの階乗のmodに関する逆元を求める
    fact_inv = [1]*(n+1)
    fact_inv[n] = pow(fact[n], mod-2, mod)#フェルマーの小定理
    for i in range(n, 0, -1):
        fact_inv[i-1] = fact_inv[i]*i%mod
    return fact_inv make_fact_inv def comb(n, k):#nCk
    return fact[n]*fact_inv[k]*fact_inv[n-k]%mod def comb(n, k):#nCk
    return fact[n]*fact_inv[k]*fact_inv[n-k]%mod comb inv_2 = pow(2, mod-2, mod) pow(2, mod-2, mod) inv_2 fact_inv = make_fact_inv(N*M) make_fact_inv(N*M) fact_inv ans+=(Sum[x-1]+Sum[N-x])*M+(Sum[y-1]+Sum[M-y])*N (Sum[x-1]+Sum[N-x])*M+(Sum[y-1]+Sum[M-y])*N ans ans%=mod mod ans N, M, K = map(int, input().split()) map(int, input().split()) N Sum = [0]*(max(N, M)+1) [0]*(max(N, M)+1) Sum mod = 10**9+7 10**9+7 mod M, K = map(int, input().split()) map(int, input().split()) M ans = 0 0 ans K = map(int, input().split()) map(int, input().split()) K
mod = 10**9+7
inv_2 = pow(2, mod-2, mod)
N, M, K = map(int, input().split())
def make_fact(n):#0~nの階乗を求める
    fact = [1]*(n+1)
    for i in range(1, n+1):
        fact[i] = fact[i-1]*i%mod
    return fact

def make_fact_inv(n):#0~nの階乗のmodに関する逆元を求める
    fact_inv = [1]*(n+1)
    fact_inv[n] = pow(fact[n], mod-2, mod)#フェルマーの小定理
    for i in range(n, 0, -1):
        fact_inv[i-1] = fact_inv[i]*i%mod
    return fact_inv

def comb(n, k):#nCk
    return fact[n]*fact_inv[k]*fact_inv[n-k]%mod
fact = make_fact(N*M)
fact_inv = make_fact_inv(N*M)
Sum = [0]*(max(N, M)+1)
for i in range(1, len(Sum)):
    Sum[i] = (Sum[i-1]+i)%mod
ans = 0

for x in range(1, N+1):
    for y in range(1, M+1):
        ans+=(Sum[x-1]+Sum[N-x])*M+(Sum[y-1]+Sum[M-y])*N
        ans%=mod
print(ans*comb(N*M-2, K-2)*inv_2%mod)