class PERM_COMB_MOD():
    # http://drken1215.hatenablog.com/entry/2018/06/08/210000
    def __init__(self, max_n=510000, mod=10**9+7):
        self.fac = [0]*max_n
        self.finv = [0]*max_n
        self.inv = [0]*max_n
        self.fac[0] = self.fac[1] = 1
        self.finv[0] = self.finv[1] = 1
        self.inv[1] = 1
        self.max = max_n
        self.mod = mod
        self._maesyori()

    def _maesyori(self):
        for i in range(2,self.max):
            self.fac[i] = self.fac[i-1] * i % self.mod
            self.inv[i] = self.mod - self.inv[self.mod % i] * (self.mod // i) % self.mod
            self.finv[i] = self.finv[i-1] * self.inv[i] % self.mod

    def perm(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * self.finv[n-k] % self.mod % self.mod

    def comb(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * (self.finv[k] * self.finv[n-k] % self.mod) % self.mod

n,m,k = map(int, input().split())
mod = 10**9+7
p = PERM_COMB_MOD()
ans = 0

# xについて
for i in range(1,n):
    ans += i*(n-i)*m*m % mod
    ans %= mod
# yについて
for i in range(1,m):
    ans += i*(m-i)*n*n % mod
    ans %= mod
ans *= p.comb(n*m-2,k-2)
ans %= mod
print(ans) class PERM_COMB_MOD():
    # http://drken1215.hatenablog.com/entry/2018/06/08/210000
    def __init__(self, max_n=510000, mod=10**9+7):
        self.fac = [0]*max_n
        self.finv = [0]*max_n
        self.inv = [0]*max_n
        self.fac[0] = self.fac[1] = 1
        self.finv[0] = self.finv[1] = 1
        self.inv[1] = 1
        self.max = max_n
        self.mod = mod
        self._maesyori()

    def _maesyori(self):
        for i in range(2,self.max):
            self.fac[i] = self.fac[i-1] * i % self.mod
            self.inv[i] = self.mod - self.inv[self.mod % i] * (self.mod // i) % self.mod
            self.finv[i] = self.finv[i-1] * self.inv[i] % self.mod

    def perm(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * self.finv[n-k] % self.mod % self.mod

    def comb(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * (self.finv[k] * self.finv[n-k] % self.mod) % self.mod PERM_COMB_MOD def __init__(self, max_n=510000, mod=10**9+7):
        self.fac = [0]*max_n
        self.finv = [0]*max_n
        self.inv = [0]*max_n
        self.fac[0] = self.fac[1] = 1
        self.finv[0] = self.finv[1] = 1
        self.inv[1] = 1
        self.max = max_n
        self.mod = mod
        self._maesyori()

     __init__ self.fac = [0]*max_n self.fac self fac [0]*max_n [0] 0 max_n self.finv = [0]*max_n self.finv self finv [0]*max_n [0] 0 max_n self.inv = [0]*max_n self.inv self inv [0]*max_n [0] 0 max_n self.fac[0] = self.fac[1] = 1 self.fac[0] self.fac self fac 0 1 = self.fac[1] = 1 self.fac[1] self.fac self fac 1 1 self.finv[0] = self.finv[1] = 1 self.finv[0] self.finv self finv 0 1 = self.finv[1] = 1 self.finv[1] self.finv self finv 1 1 self.inv[1] = 1 self.inv[1] self.inv self inv 1 1 self.max = max_n self.max self max max_n self.mod = mod self.mod self mod mod self._maesyori() self._maesyori self _maesyori self self max_n=510000 max_n 510000 mod=10**9+7 mod 10**9+7 10**9 10 9 7 def _maesyori(self):
        for i in range(2,self.max):
            self.fac[i] = self.fac[i-1] * i % self.mod
            self.inv[i] = self.mod - self.inv[self.mod % i] * (self.mod // i) % self.mod
            self.finv[i] = self.finv[i-1] * self.inv[i] % self.mod

     _maesyori for i in range(2,self.max):
            self.fac[i] = self.fac[i-1] * i % self.mod
            self.inv[i] = self.mod - self.inv[self.mod % i] * (self.mod // i) % self.mod
            self.finv[i] = self.finv[i-1] * self.inv[i] % self.mod

     i range(2,self.max) range 2 self.max self max self.fac[i] = self.fac[i-1] * i % self.mod self.fac[i] self.fac self fac i self.fac[i-1] * i % self.mod self.fac[i-1] * i self.fac[i-1] self.fac self fac i-1 i 1 i self.mod self mod self.inv[i] = self.mod - self.inv[self.mod % i] * (self.mod // i) % self.mod self.inv[i] self.inv self inv i self.mod - self.inv[self.mod % i] * (self.mod // i) % self.mod self.mod self mod self.inv[self.mod % i] * (self.mod // i) % self.mod self.inv[self.mod % i] * (self.mod // i) self.inv[self.mod % i] self.inv self inv self.mod % i self.mod self mod i self.mod // i self.mod self mod i self.mod self mod self.finv[i] = self.finv[i-1] * self.inv[i] % self.mod self.finv[i] self.finv self finv i self.finv[i-1] * self.inv[i] % self.mod self.finv[i-1] * self.inv[i] self.finv[i-1] self.finv self finv i-1 i 1 self.inv[i] self.inv self inv i self.mod self mod self self def perm(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * self.finv[n-k] % self.mod % self.mod

     perm if n < k : return 0
         n < k n k if n < 0 or k < 0:return 0
         n < 0 or k < 0 n < 0 n 0 k < 0 k 0 return self.fac[n] * self.finv[n-k] % self.mod % self.mod self.fac[n] * self.finv[n-k] % self.mod % self.mod self.fac[n] * self.finv[n-k] % self.mod self.fac[n] * self.finv[n-k] self.fac[n] self.fac self fac n self.finv[n-k] self.finv self finv n-k n k self.mod self mod self.mod self mod self self n n k k def comb(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * (self.finv[k] * self.finv[n-k] % self.mod) % self.mod comb if n < k : return 0
         n < k n k if n < 0 or k < 0:return 0
         n < 0 or k < 0 n < 0 n 0 k < 0 k 0 return self.fac[n] * (self.finv[k] * self.finv[n-k] % self.mod) % self.mod self.fac[n] * (self.finv[k] * self.finv[n-k] % self.mod) % self.mod self.fac[n] * (self.finv[k] * self.finv[n-k] % self.mod) self.fac[n] self.fac self fac n self.finv[k] * self.finv[n-k] % self.mod self.finv[k] * self.finv[n-k] self.finv[k] self.finv self finv k self.finv[n-k] self.finv self finv n-k n k self.mod self mod self.mod self mod self self n n k k n,m,k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k mod = 10**9+7 mod 10**9+7 10**9 10 9 7 p = PERM_COMB_MOD() p PERM_COMB_MOD() PERM_COMB_MOD ans = 0 ans 0 for i in range(1,n):
    ans += i*(n-i)*m*m % mod
    ans %= mod
# yについて i range(1,n) range 1 n ans += i*(n-i)*m*m % mod ans i*(n-i)*m*m % mod i*(n-i)*m*m i*(n-i)*m i*(n-i) i n-i n i m m mod ans %= mod ans mod for i in range(1,m):
    ans += i*(m-i)*n*n % mod
    ans %= mod i range(1,m) range 1 m ans += i*(m-i)*n*n % mod ans i*(m-i)*n*n % mod i*(m-i)*n*n i*(m-i)*n i*(m-i) i m-i m i n n mod ans %= mod ans mod ans *= p.comb(n*m-2,k-2) ans p.comb(n*m-2,k-2) p.comb p comb n*m-2 n*m n m 2 k-2 k 2 ans %= mod ans mod print(ans) print ans k = map(int, input().split()) map(int, input().split()) k n,m,k = map(int, input().split()) map(int, input().split()) n class PERM_COMB_MOD():
    # http://drken1215.hatenablog.com/entry/2018/06/08/210000
    def __init__(self, max_n=510000, mod=10**9+7):
        self.fac = [0]*max_n
        self.finv = [0]*max_n
        self.inv = [0]*max_n
        self.fac[0] = self.fac[1] = 1
        self.finv[0] = self.finv[1] = 1
        self.inv[1] = 1
        self.max = max_n
        self.mod = mod
        self._maesyori()

    def _maesyori(self):
        for i in range(2,self.max):
            self.fac[i] = self.fac[i-1] * i % self.mod
            self.inv[i] = self.mod - self.inv[self.mod % i] * (self.mod // i) % self.mod
            self.finv[i] = self.finv[i-1] * self.inv[i] % self.mod

    def perm(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * self.finv[n-k] % self.mod % self.mod

    def comb(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * (self.finv[k] * self.finv[n-k] % self.mod) % self.mod class PERM_COMB_MOD():
    # http://drken1215.hatenablog.com/entry/2018/06/08/210000
    def __init__(self, max_n=510000, mod=10**9+7):
        self.fac = [0]*max_n
        self.finv = [0]*max_n
        self.inv = [0]*max_n
        self.fac[0] = self.fac[1] = 1
        self.finv[0] = self.finv[1] = 1
        self.inv[1] = 1
        self.max = max_n
        self.mod = mod
        self._maesyori()

    def _maesyori(self):
        for i in range(2,self.max):
            self.fac[i] = self.fac[i-1] * i % self.mod
            self.inv[i] = self.mod - self.inv[self.mod % i] * (self.mod // i) % self.mod
            self.finv[i] = self.finv[i-1] * self.inv[i] % self.mod

    def perm(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * self.finv[n-k] % self.mod % self.mod

    def comb(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * (self.finv[k] * self.finv[n-k] % self.mod) % self.mod PERM_COMB_MOD mod = 10**9+7 10**9+7 mod ans += i*(m-i)*n*n % mod i*(m-i)*n*n % mod ans p = PERM_COMB_MOD() PERM_COMB_MOD() p ans += i*(n-i)*m*m % mod i*(n-i)*m*m % mod ans ans %= mod mod ans ans = 0 0 ans m,k = map(int, input().split()) map(int, input().split()) m ans %= mod mod ans ans *= p.comb(n*m-2,k-2) p.comb(n*m-2,k-2) ans ans %= mod mod ans
class PERM_COMB_MOD():
    # http://drken1215.hatenablog.com/entry/2018/06/08/210000
    def __init__(self, max_n=510000, mod=10**9+7):
        self.fac = [0]*max_n
        self.finv = [0]*max_n
        self.inv = [0]*max_n
        self.fac[0] = self.fac[1] = 1
        self.finv[0] = self.finv[1] = 1
        self.inv[1] = 1
        self.max = max_n
        self.mod = mod
        self._maesyori()

    def _maesyori(self):
        for i in range(2,self.max):
            self.fac[i] = self.fac[i-1] * i % self.mod
            self.inv[i] = self.mod - self.inv[self.mod % i] * (self.mod // i) % self.mod
            self.finv[i] = self.finv[i-1] * self.inv[i] % self.mod

    def perm(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * self.finv[n-k] % self.mod % self.mod

    def comb(self, n, k):
        if n < k : return 0
        if n < 0 or k < 0:return 0
        return self.fac[n] * (self.finv[k] * self.finv[n-k] % self.mod) % self.mod

n,m,k = map(int, input().split())
mod = 10**9+7
p = PERM_COMB_MOD()
ans = 0

# xについて
for i in range(1,n):
    ans += i*(n-i)*m*m % mod
    ans %= mod
# yについて
for i in range(1,m):
    ans += i*(m-i)*n*n % mod
    ans %= mod
ans *= p.comb(n*m-2,k-2)
ans %= mod
print(ans)