import math

N, M, K = (int(x) for x in input().split())

def comb(n,k,p):
    if k < 0 or k > n:
        return 0
    if n == 0 or k == 0:
        return 1
    a=math.factorial(n) % p
    b=math.factorial(k) % p
    c=math.factorial(n-k) % p
    return (a*mypow(b,p-2,p)*mypow(c,p-2,p)) % p

def mypow(a,b,p):
    if b == 0: return 1
    if b % 2 == 0:
        d=mypow(a,b//2,p)
        return d*d % p
    if b % 2 == 1:
        return (a*mypow(a,b-1,p )) % p

c_sum = (M*(N-1)*N*(N+1)*M+N*(M-1)*M*(M+1)*N)//3
c_sum = c_sum//2
c_sum *= comb(N*M-2, K-2, 1000000007)
c_sum = c_sum % 1000000007

print(c_sum) import math math int(x) for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x) int x N, M, K = (int(x) for x in input().split()) N (int(x) for x in input().split()) M K def comb(n,k,p):
    if k < 0 or k > n:
        return 0
    if n == 0 or k == 0:
        return 1
    a=math.factorial(n) % p
    b=math.factorial(k) % p
    c=math.factorial(n-k) % p
    return (a*mypow(b,p-2,p)*mypow(c,p-2,p)) % p comb if k < 0 or k > n:
        return 0
     k < 0 or k > n k < 0 k 0 k > n k n return 0 0 if n == 0 or k == 0:
        return 1
     n == 0 or k == 0 n == 0 n 0 k == 0 k 0 return 1 1 a=math.factorial(n) % p a math.factorial(n) % p math.factorial(n) math.factorial math factorial n p b=math.factorial(k) % p b math.factorial(k) % p math.factorial(k) math.factorial math factorial k p c=math.factorial(n-k) % p c math.factorial(n-k) % p math.factorial(n-k) math.factorial math factorial n-k n k p return (a*mypow(b,p-2,p)*mypow(c,p-2,p)) % p (a*mypow(b,p-2,p)*mypow(c,p-2,p)) % p a*mypow(b,p-2,p)*mypow(c,p-2,p) a*mypow(b,p-2,p) a mypow(b,p-2,p) mypow b p-2 p 2 p mypow(c,p-2,p) mypow c p-2 p 2 p p n n k k p p def mypow(a,b,p):
    if b == 0: return 1
    if b % 2 == 0:
        d=mypow(a,b//2,p)
        return d*d % p
    if b % 2 == 1:
        return (a*mypow(a,b-1,p )) % p mypow if b == 0: return 1
     b == 0 b 0 if b % 2 == 0:
        d=mypow(a,b//2,p)
        return d*d % p
     b % 2 == 0 b % 2 b 2 0 d=mypow(a,b//2,p) d mypow(a,b//2,p) mypow a b//2 b 2 p return d*d % p d*d % p d*d d d p if b % 2 == 1:
        return (a*mypow(a,b-1,p )) % p b % 2 == 1 b % 2 b 2 1 return (a*mypow(a,b-1,p )) % p (a*mypow(a,b-1,p )) % p a*mypow(a,b-1,p ) a mypow(a,b-1,p ) mypow a b-1 b 1 p p a a b b p p c_sum = (M*(N-1)*N*(N+1)*M+N*(M-1)*M*(M+1)*N)//3 c_sum (M*(N-1)*N*(N+1)*M+N*(M-1)*M*(M+1)*N)//3 M*(N-1)*N*(N+1)*M+N*(M-1)*M*(M+1)*N M*(N-1)*N*(N+1)*M M*(N-1)*N*(N+1) M*(N-1)*N M*(N-1) M N-1 N 1 N N+1 N 1 M N*(M-1)*M*(M+1)*N N*(M-1)*M*(M+1) N*(M-1)*M N*(M-1) N M-1 M 1 M M+1 M 1 N 3 c_sum = c_sum//2 c_sum c_sum//2 c_sum 2 c_sum *= comb(N*M-2, K-2, 1000000007) c_sum comb(N*M-2, K-2, 1000000007) comb N*M-2 N*M N M 2 K-2 K 2 1000000007 c_sum = c_sum % 1000000007 c_sum c_sum % 1000000007 c_sum 1000000007 print(c_sum) print c_sum M, K = (int(x) for x in input().split()) (int(x) for x in input().split()) M N, M, K = (int(x) for x in input().split()) (int(x) for x in input().split()) N c_sum = c_sum//2 c_sum//2 c_sum def comb(n,k,p):
    if k < 0 or k > n:
        return 0
    if n == 0 or k == 0:
        return 1
    a=math.factorial(n) % p
    b=math.factorial(k) % p
    c=math.factorial(n-k) % p
    return (a*mypow(b,p-2,p)*mypow(c,p-2,p)) % p def comb(n,k,p):
    if k < 0 or k > n:
        return 0
    if n == 0 or k == 0:
        return 1
    a=math.factorial(n) % p
    b=math.factorial(k) % p
    c=math.factorial(n-k) % p
    return (a*mypow(b,p-2,p)*mypow(c,p-2,p)) % p comb def mypow(a,b,p):
    if b == 0: return 1
    if b % 2 == 0:
        d=mypow(a,b//2,p)
        return d*d % p
    if b % 2 == 1:
        return (a*mypow(a,b-1,p )) % p def mypow(a,b,p):
    if b == 0: return 1
    if b % 2 == 0:
        d=mypow(a,b//2,p)
        return d*d % p
    if b % 2 == 1:
        return (a*mypow(a,b-1,p )) % p mypow c_sum *= comb(N*M-2, K-2, 1000000007) comb(N*M-2, K-2, 1000000007) c_sum c_sum = (M*(N-1)*N*(N+1)*M+N*(M-1)*M*(M+1)*N)//3 (M*(N-1)*N*(N+1)*M+N*(M-1)*M*(M+1)*N)//3 c_sum K = (int(x) for x in input().split()) (int(x) for x in input().split()) K c_sum = c_sum % 1000000007 c_sum % 1000000007 c_sum
import math

N, M, K = (int(x) for x in input().split())

def comb(n,k,p):
    if k < 0 or k > n:
        return 0
    if n == 0 or k == 0:
        return 1
    a=math.factorial(n) % p
    b=math.factorial(k) % p
    c=math.factorial(n-k) % p
    return (a*mypow(b,p-2,p)*mypow(c,p-2,p)) % p

def mypow(a,b,p):
    if b == 0: return 1
    if b % 2 == 0:
        d=mypow(a,b//2,p)
        return d*d % p
    if b % 2 == 1:
        return (a*mypow(a,b-1,p )) % p

c_sum = (M*(N-1)*N*(N+1)*M+N*(M-1)*M*(M+1)*N)//3
c_sum = c_sum//2
c_sum *= comb(N*M-2, K-2, 1000000007)
c_sum = c_sum % 1000000007

print(c_sum)
