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

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

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

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

k = cmb(M * N - 2,K - 2,mod)



def calc(p, q, d):
    return d * (p - d) * (q ** 2)

ans = 0

for i in range(N):
    ans += calc(N, M, i)
for i in range(M):
    ans += calc(M, N, i)

ans %= mod

ans *= k

ans %= mod

print(ans) N, M, K = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split M K 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 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 MAX_N = 10**6 MAX_N 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, MAX_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, MAX_N + 1 ) range 2 MAX_N + 1 MAX_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 k = cmb(M * N - 2,K - 2,mod) k cmb(M * N - 2,K - 2,mod) cmb M * N - 2 M * N M N 2 K - 2 K 2 mod def calc(p, q, d):
    return d * (p - d) * (q ** 2) calc return d * (p - d) * (q ** 2) d * (p - d) * (q ** 2) d * (p - d) d p - d p d q ** 2 q 2 p p q q d d ans = 0 ans 0 for i in range(N):
    ans += calc(N, M, i) i range(N) range N ans += calc(N, M, i) ans calc(N, M, i) calc N M i for i in range(M):
    ans += calc(M, N, i) i range(M) range M ans += calc(M, N, i) ans calc(M, N, i) calc M N i ans %= mod ans mod ans *= k ans k ans %= mod ans mod print(ans) print ans N, M, K = map(int,input().split()) map(int,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 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 MAX_N = 10**6 10**6 MAX_N ans += calc(N, M, i) calc(N, M, i) ans ans *= k k ans g1 = [1, 1] [1, 1] g1 def calc(p, q, d):
    return d * (p - d) * (q ** 2) def calc(p, q, d):
    return d * (p - d) * (q ** 2) calc K = map(int,input().split()) map(int,input().split()) K mod = 10**9+7 10**9+7 mod ans += calc(M, N, i) calc(M, N, i) ans inverse = [0, 1] [0, 1] inverse ans %= mod mod ans M, K = map(int,input().split()) map(int,input().split()) M k = cmb(M * N - 2,K - 2,mod) cmb(M * N - 2,K - 2,mod) k g2 = [1, 1] [1, 1] g2 ans %= mod mod ans ans = 0 0 ans
N, M, K = map(int,input().split())

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

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

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

k = cmb(M * N - 2,K - 2,mod)



def calc(p, q, d):
    return d * (p - d) * (q ** 2)

ans = 0

for i in range(N):
    ans += calc(N, M, i)
for i in range(M):
    ans += calc(M, N, i)

ans %= mod

ans *= k

ans %= mod

print(ans)