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


n, m, k = [int(_) for _ in input().split()]

mod = 10**9+7 #出力の制限
N = n * m
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル

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

ans = 0
C = cmb(n * m - 2, k - 2, mod)
for d in range(1, n):
    ans += ((n - d) * m ** 2) * d
    ans %= mod
for d in range(1, m):
    ans += ((m - d) * n ** 2) * d
    ans %= mod
ans = (ans * C) % mod
print(ans) def cmb(n, r, 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 int(_) for _ in input().split() for _ in input().split() _ input().split() ().split () input split for _ in input().split() int(_) int _ n, m, k = [int(_) for _ in input().split()] n [int(_) for _ in input().split()] m k mod = 10**9+7 mod 10**9+7 10**9 10 9 7 N = n * m N n * m n m 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, N + 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, N + 1 ) range 2 N + 1 N 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 C = cmb(n * m - 2, k - 2, mod) C cmb(n * m - 2, k - 2, mod) cmb n * m - 2 n * m n m 2 k - 2 k 2 mod for d in range(1, n):
    ans += ((n - d) * m ** 2) * d
    ans %= mod d range(1, n) range 1 n ans += ((n - d) * m ** 2) * d ans ((n - d) * m ** 2) * d (n - d) * m ** 2 n - d n d m ** 2 m 2 d ans %= mod ans mod for d in range(1, m):
    ans += ((m - d) * n ** 2) * d
    ans %= mod d range(1, m) range 1 m ans += ((m - d) * n ** 2) * d ans ((m - d) * n ** 2) * d (m - d) * n ** 2 m - d m d n ** 2 n 2 d ans %= mod ans mod ans = (ans * C) % mod ans (ans * C) % mod ans * C ans C mod print(ans) print ans ans = (ans * C) % mod (ans * C) % mod ans N = n * m n * m N mod = 10**9+7 10**9+7 mod ans += ((m - d) * n ** 2) * d ((m - d) * n ** 2) * d ans k = [int(_) for _ in input().split()] [int(_) for _ in input().split()] k g1 = [1, 1] [1, 1] g1 m, k = [int(_) for _ in input().split()] [int(_) for _ in input().split()] m ans = 0 0 ans C = cmb(n * m - 2, k - 2, mod) cmb(n * m - 2, k - 2, mod) C ans += ((n - d) * m ** 2) * d ((n - d) * m ** 2) * d ans inverse = [0, 1] [0, 1] inverse g2 = [1, 1] [1, 1] g2 ans %= mod mod ans def cmb(n, r, 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):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod cmb ans %= mod mod ans n, m, k = [int(_) for _ in input().split()] [int(_) for _ in input().split()] n
def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod


n, m, k = [int(_) for _ in input().split()]

mod = 10**9+7 #出力の制限
N = n * m
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル

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

ans = 0
C = cmb(n * m - 2, k - 2, mod)
for d in range(1, n):
    ans += ((n - d) * m ** 2) * d
    ans %= mod
for d in range(1, m):
    ans += ((m - d) * n ** 2) * d
    ans %= mod
ans = (ans * C) % mod
print(ans)