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 #出力の制限
N = 2*(10**5)
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 )


N,M,K = map(int,input().split())
a=cmb(N*M-2, K-2, mod)
b=((N**2)*M*(M+1)*(M-1)//6)%(10**9+7)
c=((M**2)*N*(N+1)*(N-1)//6)%(10**9+7)
print((a*(b+c))%(10**9+7)) 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 N = 2*(10**5) N 2*(10**5) 2 10**5 10 5 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 N,M,K = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split M K a=cmb(N*M-2, K-2, mod) a cmb(N*M-2, K-2, mod) cmb N*M-2 N*M N M 2 K-2 K 2 mod b=((N**2)*M*(M+1)*(M-1)//6)%(10**9+7) b ((N**2)*M*(M+1)*(M-1)//6)%(10**9+7) (N**2)*M*(M+1)*(M-1)//6 (N**2)*M*(M+1)*(M-1) (N**2)*M*(M+1) (N**2)*M N**2 N 2 M M+1 M 1 M-1 M 1 6 10**9+7 10**9 10 9 7 c=((M**2)*N*(N+1)*(N-1)//6)%(10**9+7) c ((M**2)*N*(N+1)*(N-1)//6)%(10**9+7) (M**2)*N*(N+1)*(N-1)//6 (M**2)*N*(N+1)*(N-1) (M**2)*N*(N+1) (M**2)*N M**2 M 2 N N+1 N 1 N-1 N 1 6 10**9+7 10**9 10 9 7 print((a*(b+c))%(10**9+7)) print (a*(b+c))%(10**9+7) a*(b+c) a b+c b c 10**9+7 10**9 10 9 7 c=((M**2)*N*(N+1)*(N-1)//6)%(10**9+7) ((M**2)*N*(N+1)*(N-1)//6)%(10**9+7) c mod = 10**9+7 10**9+7 mod g1 = [1, 1] [1, 1] g1 a=cmb(N*M-2, K-2, mod) cmb(N*M-2, K-2, mod) a N = 2*(10**5) 2*(10**5) N M,K = map(int,input().split()) map(int,input().split()) M b=((N**2)*M*(M+1)*(M-1)//6)%(10**9+7) ((N**2)*M*(M+1)*(M-1)//6)%(10**9+7) b g2 = [1, 1] [1, 1] g2 N,M,K = map(int,input().split()) map(int,input().split()) N K = map(int,input().split()) map(int,input().split()) 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 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 inverse = [0, 1] [0, 1] inverse
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 #出力の制限
N = 2*(10**5)
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 )


N,M,K = map(int,input().split())
a=cmb(N*M-2, K-2, mod)
b=((N**2)*M*(M+1)*(M-1)//6)%(10**9+7)
c=((M**2)*N*(N+1)*(N-1)//6)%(10**9+7)
print((a*(b+c))%(10**9+7))