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

def cmb(n, r, mod=mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod

NN = 10**6 # 使うデータによって変える
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル

for i in range( 2, NN + 1 ):
    g1.append( ( g1[-1] * i ) % mod )
    inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2.append( (g2[-1] * inverse[-1]) % mod )

ans = 0
for n in range(1, N+1):
    le = n*(n-1)//2 + (N-n)*(N-n+1)//2
    le *= M**2
    ans += le

for m in range(1, M+1):
    le = m*(m-1)//2 + (M-m)*(M-m+1)//2
    le *= N**2
    ans += le

ans //= 2
ans %= mod
ans =  ans * cmb(N*M-2, K-2) % mod
print(ans) 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 def cmb(n, r, mod=mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod cmb if ( r<0 or r>n ):
        return 0
     r<0 or r>n r<0 r 0 r>n r n return 0 0 r = min(r, n-r) r min(r, n-r) min r n-r n r return g1[n] * g2[r] * g2[n-r] % mod g1[n] * g2[r] * g2[n-r] % mod g1[n] * g2[r] * g2[n-r] g1[n] * g2[r] g1[n] g1 n g2[r] g2 r g2[n-r] g2 n-r n r mod n n r r mod=mod mod mod NN = 10**6 NN 10**6 10 6 g1 = [1, 1] g1 [1, 1] 1 1 g2 = [1, 1] g2 [1, 1] 1 1 inverse = [0, 1] inverse [0, 1] 0 1 for i in range( 2, NN + 1 ):
    g1.append( ( g1[-1] * i ) % mod )
    inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2.append( (g2[-1] * inverse[-1]) % mod ) i range( 2, NN + 1 ) range 2 NN + 1 NN 1 g1.append( ( g1[-1] * i ) % mod ) g1.append g1 append ( g1[-1] * i ) % mod g1[-1] * i g1[-1] g1 -1 i mod inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod ) inverse.append inverse append ( -inverse[mod % i] * (mod//i) ) % mod -inverse[mod % i] * (mod//i) -inverse[mod % i] inverse[mod % i] inverse mod % i mod i mod//i mod i mod g2.append( (g2[-1] * inverse[-1]) % mod ) g2.append g2 append (g2[-1] * inverse[-1]) % mod g2[-1] * inverse[-1] g2[-1] g2 -1 inverse[-1] inverse -1 mod ans = 0 ans 0 for n in range(1, N+1):
    le = n*(n-1)//2 + (N-n)*(N-n+1)//2
    le *= M**2
    ans += le n range(1, N+1) range 1 N+1 N 1 le = n*(n-1)//2 + (N-n)*(N-n+1)//2 le n*(n-1)//2 + (N-n)*(N-n+1)//2 n*(n-1)//2 n*(n-1) n n-1 n 1 2 (N-n)*(N-n+1)//2 (N-n)*(N-n+1) N-n N n N-n+1 N-n N n 1 2 le *= M**2 le M**2 M 2 ans += le ans le for m in range(1, M+1):
    le = m*(m-1)//2 + (M-m)*(M-m+1)//2
    le *= N**2
    ans += le m range(1, M+1) range 1 M+1 M 1 le = m*(m-1)//2 + (M-m)*(M-m+1)//2 le m*(m-1)//2 + (M-m)*(M-m+1)//2 m*(m-1)//2 m*(m-1) m m-1 m 1 2 (M-m)*(M-m+1)//2 (M-m)*(M-m+1) M-m M m M-m+1 M-m M m 1 2 le *= N**2 le N**2 N 2 ans += le ans le ans //= 2 ans 2 ans %= mod ans mod ans =  ans * cmb(N*M-2, K-2) % mod ans ans * cmb(N*M-2, K-2) % mod ans * cmb(N*M-2, K-2) ans cmb(N*M-2, K-2) cmb N*M-2 N*M N M 2 K-2 K 2 mod print(ans) print ans N, M, K = map(int, input().split()) map(int, input().split()) N ans = 0 0 ans inverse = [0, 1] [0, 1] inverse le = m*(m-1)//2 + (M-m)*(M-m+1)//2 m*(m-1)//2 + (M-m)*(M-m+1)//2 le ans //= 2 2 ans K = map(int, input().split()) map(int, input().split()) K NN = 10**6 10**6 NN def cmb(n, r, mod=mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod def cmb(n, r, mod=mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod cmb ans =  ans * cmb(N*M-2, K-2) % mod ans * cmb(N*M-2, K-2) % mod ans g1 = [1, 1] [1, 1] g1 ans %= mod mod ans le = n*(n-1)//2 + (N-n)*(N-n+1)//2 n*(n-1)//2 + (N-n)*(N-n+1)//2 le ans += le le ans le *= N**2 N**2 le M, K = map(int, input().split()) map(int, input().split()) M ans += le le ans mod = 10**9+7 10**9+7 mod le *= M**2 M**2 le g2 = [1, 1] [1, 1] g2
N, M, K = map(int, input().split())
mod = 10**9+7

def cmb(n, r, mod=mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod

NN = 10**6 # 使うデータによって変える
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル

for i in range( 2, NN + 1 ):
    g1.append( ( g1[-1] * i ) % mod )
    inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2.append( (g2[-1] * inverse[-1]) % mod )

ans = 0
for n in range(1, N+1):
    le = n*(n-1)//2 + (N-n)*(N-n+1)//2
    le *= M**2
    ans += le

for m in range(1, M+1):
    le = m*(m-1)//2 + (M-m)*(M-m+1)//2
    le *= N**2
    ans += le

ans //= 2
ans %= mod
ans =  ans * cmb(N*M-2, K-2) % mod
print(ans)