class Factorial:
    def __init__(self,n,mod):
        self.f=[1]
        for i in range(1,n+1):
            self.f.append(self.f[-1]*i%mod)
        self.i=[pow(self.f[-1],mod-2,mod)]
        for i in range(1,n+1)[::-1]:
            self.i.append(self.i[-1]*i%mod)
        self.i.reverse()
    def factorial(self,i):
        return self.f[i]
    def ifactorial(self,i):
        return self.i[i]
    def comb(self,n,k):
        return self.f[n]*self.i[n-k]*self.i[k]
n,m,k=map(int,input().split())
M=10**9+7
print((sum(m*m*i*(n-i)for i in range(n))+sum(n*n*i*(m-i)for i in range(m)))*Factorial(n*m,M).comb(n*m-2,k-2)%M) class Factorial:
    def __init__(self,n,mod):
        self.f=[1]
        for i in range(1,n+1):
            self.f.append(self.f[-1]*i%mod)
        self.i=[pow(self.f[-1],mod-2,mod)]
        for i in range(1,n+1)[::-1]:
            self.i.append(self.i[-1]*i%mod)
        self.i.reverse()
    def factorial(self,i):
        return self.f[i]
    def ifactorial(self,i):
        return self.i[i]
    def comb(self,n,k):
        return self.f[n]*self.i[n-k]*self.i[k] Factorial def __init__(self,n,mod):
        self.f=[1]
        for i in range(1,n+1):
            self.f.append(self.f[-1]*i%mod)
        self.i=[pow(self.f[-1],mod-2,mod)]
        for i in range(1,n+1)[::-1]:
            self.i.append(self.i[-1]*i%mod)
        self.i.reverse()
     __init__ self.f=[1] self.f self f [1] 1 for i in range(1,n+1):
            self.f.append(self.f[-1]*i%mod)
         i range(1,n+1) range 1 n+1 n 1 self.f.append(self.f[-1]*i%mod) self.f.append self.f self f append self.f[-1]*i%mod self.f[-1]*i self.f[-1] self.f self f -1 i mod self.i=[pow(self.f[-1],mod-2,mod)] self.i self i [pow(self.f[-1],mod-2,mod)] pow(self.f[-1],mod-2,mod) pow self.f[-1] self.f self f -1 mod-2 mod 2 mod for i in range(1,n+1)[::-1]:
            self.i.append(self.i[-1]*i%mod)
         i range(1,n+1)[::-1] (1,n+1) range 1 n+1 n 1 ::-1 -1 self.i.append(self.i[-1]*i%mod) self.i.append self.i self i append self.i[-1]*i%mod self.i[-1]*i self.i[-1] self.i self i -1 i mod self.i.reverse() self.i.reverse self.i self i reverse self self n n mod mod def factorial(self,i):
        return self.f[i]
     factorial return self.f[i] self.f[i] self.f self f i self self i i def ifactorial(self,i):
        return self.i[i]
     ifactorial return self.i[i] self.i[i] self.i self i i self self i i def comb(self,n,k):
        return self.f[n]*self.i[n-k]*self.i[k] comb return self.f[n]*self.i[n-k]*self.i[k] self.f[n]*self.i[n-k]*self.i[k] self.f[n]*self.i[n-k] self.f[n] self.f self f n self.i[n-k] self.i self i n-k n k self.i[k] self.i self i k 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 M=10**9+7 M 10**9+7 10**9 10 9 7 print((sum(m*m*i*(n-i)for i in range(n))+sum(n*n*i*(m-i)for i in range(m)))*Factorial(n*m,M).comb(n*m-2,k-2)%M) print (sum(m*m*i*(n-i)for i in range(n))+sum(n*n*i*(m-i)for i in range(m)))*Factorial(n*m,M).comb(n*m-2,k-2)%M (sum(m*m*i*(n-i)for i in range(n))+sum(n*n*i*(m-i)for i in range(m)))*Factorial(n*m,M).comb(n*m-2,k-2) sum(m*m*i*(n-i)for i in range(n))+sum(n*n*i*(m-i)for i in range(m)) sum(m*m*i*(n-i)for i in range(n)) sum m*m*i*(n-i) m*m*i m*m m m i n-i n i sum(n*n*i*(m-i)for i in range(m)) sum n*n*i*(m-i) n*n*i n*n n n i m-i m i Factorial(n*m,M).comb(n*m-2,k-2) (n*m,M).comb (n*m,M) Factorial n*m n m M comb n*m-2 n*m n m 2 k-2 k 2 M m,k=map(int,input().split()) map(int,input().split()) m n,m,k=map(int,input().split()) map(int,input().split()) n M=10**9+7 10**9+7 M class Factorial:
    def __init__(self,n,mod):
        self.f=[1]
        for i in range(1,n+1):
            self.f.append(self.f[-1]*i%mod)
        self.i=[pow(self.f[-1],mod-2,mod)]
        for i in range(1,n+1)[::-1]:
            self.i.append(self.i[-1]*i%mod)
        self.i.reverse()
    def factorial(self,i):
        return self.f[i]
    def ifactorial(self,i):
        return self.i[i]
    def comb(self,n,k):
        return self.f[n]*self.i[n-k]*self.i[k] class Factorial:
    def __init__(self,n,mod):
        self.f=[1]
        for i in range(1,n+1):
            self.f.append(self.f[-1]*i%mod)
        self.i=[pow(self.f[-1],mod-2,mod)]
        for i in range(1,n+1)[::-1]:
            self.i.append(self.i[-1]*i%mod)
        self.i.reverse()
    def factorial(self,i):
        return self.f[i]
    def ifactorial(self,i):
        return self.i[i]
    def comb(self,n,k):
        return self.f[n]*self.i[n-k]*self.i[k] Factorial k=map(int,input().split()) map(int,input().split()) k
class Factorial:
    def __init__(self,n,mod):
        self.f=[1]
        for i in range(1,n+1):
            self.f.append(self.f[-1]*i%mod)
        self.i=[pow(self.f[-1],mod-2,mod)]
        for i in range(1,n+1)[::-1]:
            self.i.append(self.i[-1]*i%mod)
        self.i.reverse()
    def factorial(self,i):
        return self.f[i]
    def ifactorial(self,i):
        return self.i[i]
    def comb(self,n,k):
        return self.f[n]*self.i[n-k]*self.i[k]
n,m,k=map(int,input().split())
M=10**9+7
print((sum(m*m*i*(n-i)for i in range(n))+sum(n*n*i*(m-i)for i in range(m)))*Factorial(n*m,M).comb(n*m-2,k-2)%M)