facs = []
M = 1000000007

def modulo(n):
    global facs
    facs = [1]*(n+1)
    last = 1
    for i in range(1,n+1):
        last = facs[i] = mulmod(last,i,M)
        
def mulmod(x,y,p):
    return x*y % p
def divmod(x,y,p):
    return mulmod(x,powmod(y,p-2,p),p)

def ncr(n,r):
    if n<r:
        return 0
    if n==r:
        return 1
    res = facs[n]
    res = divmod(res,facs[r],M)
    res = divmod(res,facs[n-r],M)
    return res

def powmod(x,y,p):
    if y==0:
        return 1
    elif y==1:
        return x % p
    elif (y%2)==0:
        return powmod(x,y//2,p)**2 % p
    else:
        return powmod(x,y//2,p)**2 * x % p
def resolve():
    n,m,k = map(int,input().split())
    modulo(2*10**5+5)
    kumi=ncr(n*m-2,k-2)
    ans = 0
    for i in range(1,n):
        ans = ans + ((i*(n-i)*m*m)%M)
    for i in range(1,m):
        ans = ans + ((i*(m-i)*n*n)%M)
    print(ans*kumi%M)

if __name__ == "__main__":
    resolve() facs = [] facs [] M = 1000000007 M 1000000007 def modulo(n):
    global facs
    facs = [1]*(n+1)
    last = 1
    for i in range(1,n+1):
        last = facs[i] = mulmod(last,i,M)
         modulo global facs facs = [1]*(n+1) facs [1]*(n+1) [1] 1 n+1 n 1 last = 1 last 1 for i in range(1,n+1):
        last = facs[i] = mulmod(last,i,M)
         i range(1,n+1) range 1 n+1 n 1 last = facs[i] = mulmod(last,i,M) last mulmod(last,i,M) mulmod last i M = facs[i] = mulmod(last,i,M) facs[i] facs i mulmod(last,i,M) n n def mulmod(x,y,p):
    return x*y % p mulmod return x*y % p x*y % p x*y x y p x x y y p p def divmod(x,y,p):
    return mulmod(x,powmod(y,p-2,p),p) divmod return mulmod(x,powmod(y,p-2,p),p) mulmod(x,powmod(y,p-2,p),p) mulmod x powmod(y,p-2,p) powmod y p-2 p 2 p p x x y y p p def ncr(n,r):
    if n<r:
        return 0
    if n==r:
        return 1
    res = facs[n]
    res = divmod(res,facs[r],M)
    res = divmod(res,facs[n-r],M)
    return res ncr if n<r:
        return 0
     n<r n r return 0 0 if n==r:
        return 1
     n==r n r return 1 1 res = facs[n] res facs[n] facs n res = divmod(res,facs[r],M) res divmod(res,facs[r],M) divmod res facs[r] facs r M res = divmod(res,facs[n-r],M) res divmod(res,facs[n-r],M) divmod res facs[n-r] facs n-r n r M return res res n n r r def powmod(x,y,p):
    if y==0:
        return 1
    elif y==1:
        return x % p
    elif (y%2)==0:
        return powmod(x,y//2,p)**2 % p
    else:
        return powmod(x,y//2,p)**2 * x % p powmod if y==0:
        return 1
    elif y==1:
        return x % p
    elif (y%2)==0:
        return powmod(x,y//2,p)**2 % p
    else:
        return powmod(x,y//2,p)**2 * x % p y==0 y 0 return 1 1 elif y==1:
        return x % p
     y==1 y 1 return x % p x % p x p elif (y%2)==0:
        return powmod(x,y//2,p)**2 % p
     (y%2)==0 y%2 y 2 0 return powmod(x,y//2,p)**2 % p powmod(x,y//2,p)**2 % p powmod(x,y//2,p)**2 powmod(x,y//2,p) powmod x y//2 y 2 p 2 p return powmod(x,y//2,p)**2 * x % p powmod(x,y//2,p)**2 * x % p powmod(x,y//2,p)**2 * x powmod(x,y//2,p)**2 powmod(x,y//2,p) powmod x y//2 y 2 p 2 x p x x y y p p def resolve():
    n,m,k = map(int,input().split())
    modulo(2*10**5+5)
    kumi=ncr(n*m-2,k-2)
    ans = 0
    for i in range(1,n):
        ans = ans + ((i*(n-i)*m*m)%M)
    for i in range(1,m):
        ans = ans + ((i*(m-i)*n*n)%M)
    print(ans*kumi%M) resolve n,m,k = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split m k modulo(2*10**5+5) modulo 2*10**5+5 2*10**5 2 10**5 10 5 5 kumi=ncr(n*m-2,k-2) kumi ncr(n*m-2,k-2) ncr n*m-2 n*m n m 2 k-2 k 2 ans = 0 ans 0 for i in range(1,n):
        ans = ans + ((i*(n-i)*m*m)%M)
     i range(1,n) range 1 n ans = ans + ((i*(n-i)*m*m)%M) ans ans + ((i*(n-i)*m*m)%M) ans (i*(n-i)*m*m)%M i*(n-i)*m*m i*(n-i)*m i*(n-i) i n-i n i m m M for i in range(1,m):
        ans = ans + ((i*(m-i)*n*n)%M)
     i range(1,m) range 1 m ans = ans + ((i*(m-i)*n*n)%M) ans ans + ((i*(m-i)*n*n)%M) ans (i*(m-i)*n*n)%M i*(m-i)*n*n i*(m-i)*n i*(m-i) i m-i m i n n M print(ans*kumi%M) print ans*kumi%M ans*kumi ans kumi M if __name__ == "__main__":
    resolve() __name__ == "__main__" __name__ "__main__" resolve() resolve M = 1000000007 1000000007 M def divmod(x,y,p):
    return mulmod(x,powmod(y,p-2,p),p) def divmod(x,y,p):
    return mulmod(x,powmod(y,p-2,p),p) divmod def resolve():
    n,m,k = map(int,input().split())
    modulo(2*10**5+5)
    kumi=ncr(n*m-2,k-2)
    ans = 0
    for i in range(1,n):
        ans = ans + ((i*(n-i)*m*m)%M)
    for i in range(1,m):
        ans = ans + ((i*(m-i)*n*n)%M)
    print(ans*kumi%M) def resolve():
    n,m,k = map(int,input().split())
    modulo(2*10**5+5)
    kumi=ncr(n*m-2,k-2)
    ans = 0
    for i in range(1,n):
        ans = ans + ((i*(n-i)*m*m)%M)
    for i in range(1,m):
        ans = ans + ((i*(m-i)*n*n)%M)
    print(ans*kumi%M) resolve def powmod(x,y,p):
    if y==0:
        return 1
    elif y==1:
        return x % p
    elif (y%2)==0:
        return powmod(x,y//2,p)**2 % p
    else:
        return powmod(x,y//2,p)**2 * x % p def powmod(x,y,p):
    if y==0:
        return 1
    elif y==1:
        return x % p
    elif (y%2)==0:
        return powmod(x,y//2,p)**2 % p
    else:
        return powmod(x,y//2,p)**2 * x % p powmod def modulo(n):
    global facs
    facs = [1]*(n+1)
    last = 1
    for i in range(1,n+1):
        last = facs[i] = mulmod(last,i,M)
         def modulo(n):
    global facs
    facs = [1]*(n+1)
    last = 1
    for i in range(1,n+1):
        last = facs[i] = mulmod(last,i,M)
         modulo def ncr(n,r):
    if n<r:
        return 0
    if n==r:
        return 1
    res = facs[n]
    res = divmod(res,facs[r],M)
    res = divmod(res,facs[n-r],M)
    return res def ncr(n,r):
    if n<r:
        return 0
    if n==r:
        return 1
    res = facs[n]
    res = divmod(res,facs[r],M)
    res = divmod(res,facs[n-r],M)
    return res ncr def mulmod(x,y,p):
    return x*y % p def mulmod(x,y,p):
    return x*y % p mulmod facs = [] [] facs
facs = []
M = 1000000007

def modulo(n):
    global facs
    facs = [1]*(n+1)
    last = 1
    for i in range(1,n+1):
        last = facs[i] = mulmod(last,i,M)
        
def mulmod(x,y,p):
    return x*y % p
def divmod(x,y,p):
    return mulmod(x,powmod(y,p-2,p),p)

def ncr(n,r):
    if n<r:
        return 0
    if n==r:
        return 1
    res = facs[n]
    res = divmod(res,facs[r],M)
    res = divmod(res,facs[n-r],M)
    return res

def powmod(x,y,p):
    if y==0:
        return 1
    elif y==1:
        return x % p
    elif (y%2)==0:
        return powmod(x,y//2,p)**2 % p
    else:
        return powmod(x,y//2,p)**2 * x % p
def resolve():
    n,m,k = map(int,input().split())
    modulo(2*10**5+5)
    kumi=ncr(n*m-2,k-2)
    ans = 0
    for i in range(1,n):
        ans = ans + ((i*(n-i)*m*m)%M)
    for i in range(1,m):
        ans = ans + ((i*(m-i)*n*n)%M)
    print(ans*kumi%M)

if __name__ == "__main__":
    resolve()