MOD = 10**9 + 7
N,M,K= map(int,input().split())

MOD = 10**9 + 7
num = 2000020
fact = [1] * (num+1)
ifact = [1] * (num+1)

for i in range(1,num+1):
    fact[i] = (fact[i-1] * i) % MOD
ifact[-1] = pow(fact[-1],MOD-2,MOD)
for i in range(1,num+1)[::-1]:
    ifact[i-1] = (ifact[i] * i)% MOD

memo = {}
def nCr2(n,r):
    if (n,r) in memo:
        return memo[(n,r)]
    else:
        memo[(n,r)] = (fact[n] * ifact[r] * ifact[n-r]) % MOD
        return memo[(n,r)]

def nCr(n,r):
    if r > n:
        return 0
    return (fact[n] * ifact[r] * ifact[n-r]) % MOD

ans = 0
ans1 = 0
ans2 = 0

for j in range(2,K+1):
    ans1 += M**2 * nCr(2*(M-1),j-2)* nCr((N-2)*M, K-j) 
    ans1 %= MOD
ans1 *= sum((i*(N-i) for i in range(1,N)))

for j in range(2,K+1):
    ans2 += N**2 * nCr(2*(N-1),j-2) * nCr((M-2)*N, K-j)
    ans2 %= MOD
ans2 *= sum((i*(M-i) for i in range(1,M)))

ans = (ans1 + ans2) % MOD
'''

for i in range(1,N):
    print(i)
    for j in range(2,K+1):
        for k in range(1,j):
            ans += i * (N-i) *k*(j-k)*nCr(M,k) * nCr(M,j-k)* nCr((N-2)*M, K-j) 
            ans %= MOD

for i in range(1,M):
    print(i)
    for j in range(2,min(K,2*N)+1):
        for k in range(1,j):
            ans += i * (M-i) * k* (j-k) * nCr(N,k) * nCr(N,j-k) * nCr((M-2)*N, K-j)
            ans %= MOD
'''

print(ans) MOD = 10**9 + 7 MOD 10**9 + 7 10**9 10 9 7 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 num = 2000020 num 2000020 fact = [1] * (num+1) fact [1] * (num+1) [1] 1 num+1 num 1 ifact = [1] * (num+1) ifact [1] * (num+1) [1] 1 num+1 num 1 for i in range(1,num+1):
    fact[i] = (fact[i-1] * i) % MOD i range(1,num+1) range 1 num+1 num 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 ifact[-1] = pow(fact[-1],MOD-2,MOD) ifact[-1] ifact -1 pow(fact[-1],MOD-2,MOD) pow fact[-1] fact -1 MOD-2 MOD 2 MOD for i in range(1,num+1)[::-1]:
    ifact[i-1] = (ifact[i] * i)% MOD i range(1,num+1)[::-1] (1,num+1) range 1 num+1 num 1 ::-1 -1 ifact[i-1] = (ifact[i] * i)% MOD ifact[i-1] ifact i-1 i 1 (ifact[i] * i)% MOD ifact[i] * i ifact[i] ifact i i MOD memo = {} memo {} def nCr2(n,r):
    if (n,r) in memo:
        return memo[(n,r)]
    else:
        memo[(n,r)] = (fact[n] * ifact[r] * ifact[n-r]) % MOD
        return memo[(n,r)] nCr2 if (n,r) in memo:
        return memo[(n,r)]
    else:
        memo[(n,r)] = (fact[n] * ifact[r] * ifact[n-r]) % MOD
        return memo[(n,r)] (n,r) in memo (n,r) n r memo return memo[(n,r)] memo[(n,r)] memo (n,r) n r memo[(n,r)] = (fact[n] * ifact[r] * ifact[n-r]) % MOD memo[(n,r)] memo (n,r) n r (fact[n] * ifact[r] * ifact[n-r]) % MOD fact[n] * ifact[r] * ifact[n-r] fact[n] * ifact[r] fact[n] fact n ifact[r] ifact r ifact[n-r] ifact n-r n r MOD return memo[(n,r)] memo[(n,r)] memo (n,r) n r n n r r def nCr(n,r):
    if r > n:
        return 0
    return (fact[n] * ifact[r] * ifact[n-r]) % MOD nCr if r > n:
        return 0
     r > n r n return 0 0 return (fact[n] * ifact[r] * ifact[n-r]) % MOD (fact[n] * ifact[r] * ifact[n-r]) % MOD fact[n] * ifact[r] * ifact[n-r] fact[n] * ifact[r] fact[n] fact n ifact[r] ifact r ifact[n-r] ifact n-r n r MOD n n r r ans = 0 ans 0 ans1 = 0 ans1 0 ans2 = 0 ans2 0 for j in range(2,K+1):
    ans1 += M**2 * nCr(2*(M-1),j-2)* nCr((N-2)*M, K-j) 
    ans1 %= MOD j range(2,K+1) range 2 K+1 K 1 ans1 += M**2 * nCr(2*(M-1),j-2)* nCr((N-2)*M, K-j) ans1 M**2 * nCr(2*(M-1),j-2)* nCr((N-2)*M, K-j) M**2 * nCr(2*(M-1),j-2) M**2 M 2 nCr(2*(M-1),j-2) nCr 2*(M-1) 2 M-1 M 1 j-2 j 2 nCr((N-2)*M, K-j) nCr (N-2)*M N-2 N 2 M K-j K j ans1 %= MOD ans1 MOD i*(N-i) for i in range(1,N) for i in range(1,N) i range(1,N) range 1 N for i in range(1,N) i*(N-i) i N-i N i ans1 *= sum((i*(N-i) for i in range(1,N))) ans1 sum((i*(N-i) for i in range(1,N))) sum (i*(N-i) for i in range(1,N)) for j in range(2,K+1):
    ans2 += N**2 * nCr(2*(N-1),j-2) * nCr((M-2)*N, K-j)
    ans2 %= MOD j range(2,K+1) range 2 K+1 K 1 ans2 += N**2 * nCr(2*(N-1),j-2) * nCr((M-2)*N, K-j) ans2 N**2 * nCr(2*(N-1),j-2) * nCr((M-2)*N, K-j) N**2 * nCr(2*(N-1),j-2) N**2 N 2 nCr(2*(N-1),j-2) nCr 2*(N-1) 2 N-1 N 1 j-2 j 2 nCr((M-2)*N, K-j) nCr (M-2)*N M-2 M 2 N K-j K j ans2 %= MOD ans2 MOD i*(M-i) for i in range(1,M) for i in range(1,M) i range(1,M) range 1 M for i in range(1,M) i*(M-i) i M-i M i ans2 *= sum((i*(M-i) for i in range(1,M))) ans2 sum((i*(M-i) for i in range(1,M))) sum (i*(M-i) for i in range(1,M)) ans = (ans1 + ans2) % MOD ans (ans1 + ans2) % MOD ans1 + ans2 ans1 ans2 MOD '''

for i in range(1,N):
    print(i)
    for j in range(2,K+1):
        for k in range(1,j):
            ans += i * (N-i) *k*(j-k)*nCr(M,k) * nCr(M,j-k)* nCr((N-2)*M, K-j) 
            ans %= MOD

for i in range(1,M):
    print(i)
    for j in range(2,min(K,2*N)+1):
        for k in range(1,j):
            ans += i * (M-i) * k* (j-k) * nCr(N,k) * nCr(N,j-k) * nCr((M-2)*N, K-j)
            ans %= MOD
''' print(ans) print ans ans2 %= MOD MOD ans2 ifact = [1] * (num+1) [1] * (num+1) ifact def nCr2(n,r):
    if (n,r) in memo:
        return memo[(n,r)]
    else:
        memo[(n,r)] = (fact[n] * ifact[r] * ifact[n-r]) % MOD
        return memo[(n,r)] def nCr2(n,r):
    if (n,r) in memo:
        return memo[(n,r)]
    else:
        memo[(n,r)] = (fact[n] * ifact[r] * ifact[n-r]) % MOD
        return memo[(n,r)] nCr2 ans1 %= MOD MOD ans1 M,K= map(int,input().split()) map(int,input().split()) M MOD = 10**9 + 7 10**9 + 7 MOD ans = (ans1 + ans2) % MOD (ans1 + ans2) % MOD ans ans1 += M**2 * nCr(2*(M-1),j-2)* nCr((N-2)*M, K-j) M**2 * nCr(2*(M-1),j-2)* nCr((N-2)*M, K-j) ans1 def nCr(n,r):
    if r > n:
        return 0
    return (fact[n] * ifact[r] * ifact[n-r]) % MOD def nCr(n,r):
    if r > n:
        return 0
    return (fact[n] * ifact[r] * ifact[n-r]) % MOD nCr ans1 = 0 0 ans1 ans2 *= sum((i*(M-i) for i in range(1,M))) sum((i*(M-i) for i in range(1,M))) ans2 MOD = 10**9 + 7 10**9 + 7 MOD ans = 0 0 ans ans1 *= sum((i*(N-i) for i in range(1,N))) sum((i*(N-i) for i in range(1,N))) ans1 N,M,K= map(int,input().split()) map(int,input().split()) N num = 2000020 2000020 num ans2 = 0 0 ans2 K= map(int,input().split()) map(int,input().split()) K ans2 += N**2 * nCr(2*(N-1),j-2) * nCr((M-2)*N, K-j) N**2 * nCr(2*(N-1),j-2) * nCr((M-2)*N, K-j) ans2 fact = [1] * (num+1) [1] * (num+1) fact memo = {} {} memo
MOD = 10**9 + 7
N,M,K= map(int,input().split())

MOD = 10**9 + 7
num = 2000020
fact = [1] * (num+1)
ifact = [1] * (num+1)

for i in range(1,num+1):
    fact[i] = (fact[i-1] * i) % MOD
ifact[-1] = pow(fact[-1],MOD-2,MOD)
for i in range(1,num+1)[::-1]:
    ifact[i-1] = (ifact[i] * i)% MOD

memo = {}
def nCr2(n,r):
    if (n,r) in memo:
        return memo[(n,r)]
    else:
        memo[(n,r)] = (fact[n] * ifact[r] * ifact[n-r]) % MOD
        return memo[(n,r)]

def nCr(n,r):
    if r > n:
        return 0
    return (fact[n] * ifact[r] * ifact[n-r]) % MOD

ans = 0
ans1 = 0
ans2 = 0

for j in range(2,K+1):
    ans1 += M**2 * nCr(2*(M-1),j-2)* nCr((N-2)*M, K-j) 
    ans1 %= MOD
ans1 *= sum((i*(N-i) for i in range(1,N)))

for j in range(2,K+1):
    ans2 += N**2 * nCr(2*(N-1),j-2) * nCr((M-2)*N, K-j)
    ans2 %= MOD
ans2 *= sum((i*(M-i) for i in range(1,M)))

ans = (ans1 + ans2) % MOD
'''

for i in range(1,N):
    print(i)
    for j in range(2,K+1):
        for k in range(1,j):
            ans += i * (N-i) *k*(j-k)*nCr(M,k) * nCr(M,j-k)* nCr((N-2)*M, K-j) 
            ans %= MOD

for i in range(1,M):
    print(i)
    for j in range(2,min(K,2*N)+1):
        for k in range(1,j):
            ans += i * (M-i) * k* (j-k) * nCr(N,k) * nCr(N,j-k) * nCr((M-2)*N, K-j)
            ans %= MOD
'''

print(ans)
