import math
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

N,M,K = list(map(int,input().split(" ")))

ans = 0
for i in range(0,N):
    for j in range(0,M):
        mul = 2
        if i == 0 or j == 0:
            mul = 1

        ans += mul * (N -i) * (M -j) * (i+j)

ans *= combinations_count(N*M-2,K-2)
ans %= 10**9 + 7
print(ans) import math math def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) combinations_count return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) math.factorial(n) math.factorial math factorial n math.factorial(n - r) * math.factorial(r) math.factorial(n - r) math.factorial math factorial n - r n r math.factorial(r) math.factorial math factorial r n n r r N,M,K = list(map(int,input().split(" "))) N list(map(int,input().split(" "))) list map(int,input().split(" ")) map int input().split(" ") ().split () input split " " M K ans = 0 ans 0 for i in range(0,N):
    for j in range(0,M):
        mul = 2
        if i == 0 or j == 0:
            mul = 1

        ans += mul * (N -i) * (M -j) * (i+j) i range(0,N) range 0 N for j in range(0,M):
        mul = 2
        if i == 0 or j == 0:
            mul = 1

        ans += mul * (N -i) * (M -j) * (i+j) j range(0,M) range 0 M mul = 2 mul 2 if i == 0 or j == 0:
            mul = 1

         i == 0 or j == 0 i == 0 i 0 j == 0 j 0 mul = 1 mul 1 ans += mul * (N -i) * (M -j) * (i+j) ans mul * (N -i) * (M -j) * (i+j) mul * (N -i) * (M -j) mul * (N -i) mul N -i N i M -j M j i+j i j ans *= combinations_count(N*M-2,K-2) ans combinations_count(N*M-2,K-2) combinations_count N*M-2 N*M N M 2 K-2 K 2 ans %= 10**9 + 7 ans 10**9 + 7 10**9 10 9 7 print(ans) print ans K = list(map(int,input().split(" "))) list(map(int,input().split(" "))) K ans *= combinations_count(N*M-2,K-2) combinations_count(N*M-2,K-2) ans ans %= 10**9 + 7 10**9 + 7 ans mul = 2 2 mul ans = 0 0 ans M,K = list(map(int,input().split(" "))) list(map(int,input().split(" "))) M def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) combinations_count N,M,K = list(map(int,input().split(" "))) list(map(int,input().split(" "))) N ans += mul * (N -i) * (M -j) * (i+j) mul * (N -i) * (M -j) * (i+j) ans mul = 1 1 mul
import math
def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

N,M,K = list(map(int,input().split(" ")))

ans = 0
for i in range(0,N):
    for j in range(0,M):
        mul = 2
        if i == 0 or j == 0:
            mul = 1

        ans += mul * (N -i) * (M -j) * (i+j)

ans *= combinations_count(N*M-2,K-2)
ans %= 10**9 + 7
print(ans)