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 #出力の制限
N = 3*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 )

xans,yans=0,0
for i in range(1,n):
  xans+=i*cmb(n*m-2,k-2,mod)*(n-i)*m**2%mod
for i in range(1,m):
  yans+=i*cmb(n*m-2,k-2,mod)*(m-i)*n**2%mod
print((xans+yans)%mod) 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 N = 3*10**5 N 3*10**5 3 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 xans,yans=0,0 xans 0 yans 0 for i in range(1,n):
  xans+=i*cmb(n*m-2,k-2,mod)*(n-i)*m**2%mod i range(1,n) range 1 n xans+=i*cmb(n*m-2,k-2,mod)*(n-i)*m**2%mod xans i*cmb(n*m-2,k-2,mod)*(n-i)*m**2%mod i*cmb(n*m-2,k-2,mod)*(n-i)*m**2 i*cmb(n*m-2,k-2,mod)*(n-i) i*cmb(n*m-2,k-2,mod) i cmb(n*m-2,k-2,mod) cmb n*m-2 n*m n m 2 k-2 k 2 mod n-i n i m**2 m 2 mod for i in range(1,m):
  yans+=i*cmb(n*m-2,k-2,mod)*(m-i)*n**2%mod i range(1,m) range 1 m yans+=i*cmb(n*m-2,k-2,mod)*(m-i)*n**2%mod yans i*cmb(n*m-2,k-2,mod)*(m-i)*n**2%mod i*cmb(n*m-2,k-2,mod)*(m-i)*n**2 i*cmb(n*m-2,k-2,mod)*(m-i) i*cmb(n*m-2,k-2,mod) i cmb(n*m-2,k-2,mod) cmb n*m-2 n*m n m 2 k-2 k 2 mod m-i m i n**2 n 2 mod print((xans+yans)%mod) print (xans+yans)%mod xans+yans xans yans mod mod = 10**9+7 10**9+7 mod xans,yans=0,0 0 xans g2 = [1, 1] [1, 1] g2 g1 = [1, 1] [1, 1] g1 N = 3*10**5 3*10**5 N yans=0,0 0 yans n,m,k=map(int,input().split()) map(int,input().split()) n m,k=map(int,input().split()) map(int,input().split()) m xans+=i*cmb(n*m-2,k-2,mod)*(n-i)*m**2%mod i*cmb(n*m-2,k-2,mod)*(n-i)*m**2%mod xans k=map(int,input().split()) map(int,input().split()) k inverse = [0, 1] [0, 1] inverse yans+=i*cmb(n*m-2,k-2,mod)*(m-i)*n**2%mod i*cmb(n*m-2,k-2,mod)*(m-i)*n**2%mod yans 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
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 #出力の制限
N = 3*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 )

xans,yans=0,0
for i in range(1,n):
  xans+=i*cmb(n*m-2,k-2,mod)*(n-i)*m**2%mod
for i in range(1,m):
  yans+=i*cmb(n*m-2,k-2,mod)*(m-i)*n**2%mod
print((xans+yans)%mod)