class BigCombination(object):
    __slots__ = ["mod", "factorial", "inverse"]

    def __init__(self, mod: int = 10**9+7, max_n: int = 10**6):
        fac, inv = [1], []
        fac_append, inv_append = fac.append, inv.append

        for i in range(1, max_n+1):
            fac_append(fac[-1] * i % mod)

        inv_append(pow(fac[-1], mod-2, mod))

        for i in range(max_n, 0, -1):
            inv_append(inv[-1] * i % mod)

        self.mod, self.factorial, self.inverse = mod, fac, inv[::-1]

    def get_combination(self, n, r):
        return self.factorial[n] * self.inverse[r] * self.inverse[n-r] % self.mod

    def get_permutation(self, n, r):
        return self.factorial[n] * self.inverse[n-r] % self.mod



import math
Big = BigCombination()
s = 0
m = 10**9+7


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

res =0
for i in range(N-1):
  res += (i+1)*(N-i-1)*(M**2)
for i in range(M-1):
  res += (i+1)*(M-i-1)*(N**2)
if K>2:
  anp = Big.get_combination(N*M-2,K-2)
else:anp = 1
print((res*anp)%m) class BigCombination(object):
    __slots__ = ["mod", "factorial", "inverse"]

    def __init__(self, mod: int = 10**9+7, max_n: int = 10**6):
        fac, inv = [1], []
        fac_append, inv_append = fac.append, inv.append

        for i in range(1, max_n+1):
            fac_append(fac[-1] * i % mod)

        inv_append(pow(fac[-1], mod-2, mod))

        for i in range(max_n, 0, -1):
            inv_append(inv[-1] * i % mod)

        self.mod, self.factorial, self.inverse = mod, fac, inv[::-1]

    def get_combination(self, n, r):
        return self.factorial[n] * self.inverse[r] * self.inverse[n-r] % self.mod

    def get_permutation(self, n, r):
        return self.factorial[n] * self.inverse[n-r] % self.mod BigCombination __slots__ = ["mod", "factorial", "inverse"] __slots__ ["mod", "factorial", "inverse"] "mod" "factorial" "inverse" def __init__(self, mod: int = 10**9+7, max_n: int = 10**6):
        fac, inv = [1], []
        fac_append, inv_append = fac.append, inv.append

        for i in range(1, max_n+1):
            fac_append(fac[-1] * i % mod)

        inv_append(pow(fac[-1], mod-2, mod))

        for i in range(max_n, 0, -1):
            inv_append(inv[-1] * i % mod)

        self.mod, self.factorial, self.inverse = mod, fac, inv[::-1]

     __init__ fac, inv = [1], [] fac [1] 1 inv [] fac_append, inv_append = fac.append, inv.append fac_append fac.append fac append inv_append inv.append inv append for i in range(1, max_n+1):
            fac_append(fac[-1] * i % mod)

         i range(1, max_n+1) range 1 max_n+1 max_n 1 fac_append(fac[-1] * i % mod) fac_append fac[-1] * i % mod fac[-1] * i fac[-1] fac -1 i mod inv_append(pow(fac[-1], mod-2, mod)) inv_append pow(fac[-1], mod-2, mod) pow fac[-1] fac -1 mod-2 mod 2 mod for i in range(max_n, 0, -1):
            inv_append(inv[-1] * i % mod)

         i range(max_n, 0, -1) range max_n 0 -1 inv_append(inv[-1] * i % mod) inv_append inv[-1] * i % mod inv[-1] * i inv[-1] inv -1 i mod self.mod, self.factorial, self.inverse = mod, fac, inv[::-1] self.mod self mod mod self.factorial self factorial fac self.inverse self inverse inv[::-1] inv ::-1 -1 self self mod: int = 10**9+7 mod 10**9+7 10**9 10 9 7 max_n: int = 10**6 max_n 10**6 10 6 def get_combination(self, n, r):
        return self.factorial[n] * self.inverse[r] * self.inverse[n-r] % self.mod

     get_combination return self.factorial[n] * self.inverse[r] * self.inverse[n-r] % self.mod self.factorial[n] * self.inverse[r] * self.inverse[n-r] % self.mod self.factorial[n] * self.inverse[r] * self.inverse[n-r] self.factorial[n] * self.inverse[r] self.factorial[n] self.factorial self factorial n self.inverse[r] self.inverse self inverse r self.inverse[n-r] self.inverse self inverse n-r n r self.mod self mod self self n n r r def get_permutation(self, n, r):
        return self.factorial[n] * self.inverse[n-r] % self.mod get_permutation return self.factorial[n] * self.inverse[n-r] % self.mod self.factorial[n] * self.inverse[n-r] % self.mod self.factorial[n] * self.inverse[n-r] self.factorial[n] self.factorial self factorial n self.inverse[n-r] self.inverse self inverse n-r n r self.mod self mod self self n n r r object import math math Big = BigCombination() Big BigCombination() BigCombination s = 0 s 0 m = 10**9+7 m 10**9+7 10**9 10 9 7 N,M,K = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split M K res =0 res 0 for i in range(N-1):
  res += (i+1)*(N-i-1)*(M**2) i range(N-1) range N-1 N 1 res += (i+1)*(N-i-1)*(M**2) res (i+1)*(N-i-1)*(M**2) (i+1)*(N-i-1) i+1 i 1 N-i-1 N-i N i 1 M**2 M 2 for i in range(M-1):
  res += (i+1)*(M-i-1)*(N**2) i range(M-1) range M-1 M 1 res += (i+1)*(M-i-1)*(N**2) res (i+1)*(M-i-1)*(N**2) (i+1)*(M-i-1) i+1 i 1 M-i-1 M-i M i 1 N**2 N 2 if K>2:
  anp = Big.get_combination(N*M-2,K-2)
else:anp = 1 K>2 K 2 anp = Big.get_combination(N*M-2,K-2) anp Big.get_combination(N*M-2,K-2) Big.get_combination Big get_combination N*M-2 N*M N M 2 K-2 K 2 print((res*anp)%m) print (res*anp)%m res*anp res anp m N,M,K = map(int,input().split()) map(int,input().split()) N M,K = map(int,input().split()) map(int,input().split()) M Big = BigCombination() BigCombination() Big res =0 0 res m = 10**9+7 10**9+7 m anp = Big.get_combination(N*M-2,K-2) Big.get_combination(N*M-2,K-2) anp res += (i+1)*(M-i-1)*(N**2) (i+1)*(M-i-1)*(N**2) res K = map(int,input().split()) map(int,input().split()) K res += (i+1)*(N-i-1)*(M**2) (i+1)*(N-i-1)*(M**2) res class BigCombination(object):
    __slots__ = ["mod", "factorial", "inverse"]

    def __init__(self, mod: int = 10**9+7, max_n: int = 10**6):
        fac, inv = [1], []
        fac_append, inv_append = fac.append, inv.append

        for i in range(1, max_n+1):
            fac_append(fac[-1] * i % mod)

        inv_append(pow(fac[-1], mod-2, mod))

        for i in range(max_n, 0, -1):
            inv_append(inv[-1] * i % mod)

        self.mod, self.factorial, self.inverse = mod, fac, inv[::-1]

    def get_combination(self, n, r):
        return self.factorial[n] * self.inverse[r] * self.inverse[n-r] % self.mod

    def get_permutation(self, n, r):
        return self.factorial[n] * self.inverse[n-r] % self.mod class BigCombination(object):
    __slots__ = ["mod", "factorial", "inverse"]

    def __init__(self, mod: int = 10**9+7, max_n: int = 10**6):
        fac, inv = [1], []
        fac_append, inv_append = fac.append, inv.append

        for i in range(1, max_n+1):
            fac_append(fac[-1] * i % mod)

        inv_append(pow(fac[-1], mod-2, mod))

        for i in range(max_n, 0, -1):
            inv_append(inv[-1] * i % mod)

        self.mod, self.factorial, self.inverse = mod, fac, inv[::-1]

    def get_combination(self, n, r):
        return self.factorial[n] * self.inverse[r] * self.inverse[n-r] % self.mod

    def get_permutation(self, n, r):
        return self.factorial[n] * self.inverse[n-r] % self.mod BigCombination s = 0 0 s
class BigCombination(object):
    __slots__ = ["mod", "factorial", "inverse"]

    def __init__(self, mod: int = 10**9+7, max_n: int = 10**6):
        fac, inv = [1], []
        fac_append, inv_append = fac.append, inv.append

        for i in range(1, max_n+1):
            fac_append(fac[-1] * i % mod)

        inv_append(pow(fac[-1], mod-2, mod))

        for i in range(max_n, 0, -1):
            inv_append(inv[-1] * i % mod)

        self.mod, self.factorial, self.inverse = mod, fac, inv[::-1]

    def get_combination(self, n, r):
        return self.factorial[n] * self.inverse[r] * self.inverse[n-r] % self.mod

    def get_permutation(self, n, r):
        return self.factorial[n] * self.inverse[n-r] % self.mod



import math
Big = BigCombination()
s = 0
m = 10**9+7


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

res =0
for i in range(N-1):
  res += (i+1)*(N-i-1)*(M**2)
for i in range(M-1):
  res += (i+1)*(M-i-1)*(N**2)
if K>2:
  anp = Big.get_combination(N*M-2,K-2)
else:anp = 1
print((res*anp)%m)