def comb(n, k, mod=10**9+7):
    num = den = 1
    for i in range(k):
        num = num * (n-i) % mod
        den = den * (i+1) % mod
    return num * pow(den, mod-2, mod) % mod

N, M, K = map(int, input().split())
mod = 10**9 + 7
ans = 0
for i in range(N):
    for j in range(M):
        ans += (i+1)*j*(j+1)//2 + i*(M-j-1)*(M-j)//2 + M*i*(i+1)//2
        ans %= mod
ans = ans * comb(N*M-2, K-2) % mod
print(ans)
 def comb(n, k, mod=10**9+7):
    num = den = 1
    for i in range(k):
        num = num * (n-i) % mod
        den = den * (i+1) % mod
    return num * pow(den, mod-2, mod) % mod comb num = den = 1 num 1 = den = 1 den 1 for i in range(k):
        num = num * (n-i) % mod
        den = den * (i+1) % mod
     i range(k) range k num = num * (n-i) % mod num num * (n-i) % mod num * (n-i) num n-i n i mod den = den * (i+1) % mod den den * (i+1) % mod den * (i+1) den i+1 i 1 mod return num * pow(den, mod-2, mod) % mod num * pow(den, mod-2, mod) % mod num * pow(den, mod-2, mod) num pow(den, mod-2, mod) pow den mod-2 mod 2 mod mod n n k k mod=10**9+7 mod 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 mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 ans = 0 ans 0 for i in range(N):
    for j in range(M):
        ans += (i+1)*j*(j+1)//2 + i*(M-j-1)*(M-j)//2 + M*i*(i+1)//2
        ans %= mod i range(N) range N for j in range(M):
        ans += (i+1)*j*(j+1)//2 + i*(M-j-1)*(M-j)//2 + M*i*(i+1)//2
        ans %= mod j range(M) range M ans += (i+1)*j*(j+1)//2 + i*(M-j-1)*(M-j)//2 + M*i*(i+1)//2 ans (i+1)*j*(j+1)//2 + i*(M-j-1)*(M-j)//2 + M*i*(i+1)//2 (i+1)*j*(j+1)//2 + i*(M-j-1)*(M-j)//2 (i+1)*j*(j+1)//2 (i+1)*j*(j+1) (i+1)*j i+1 i 1 j j+1 j 1 2 i*(M-j-1)*(M-j)//2 i*(M-j-1)*(M-j) i*(M-j-1) i M-j-1 M-j M j 1 M-j M j 2 M*i*(i+1)//2 M*i*(i+1) M*i M i i+1 i 1 2 ans %= mod ans mod ans = ans * comb(N*M-2, K-2) % mod ans ans * comb(N*M-2, K-2) % mod ans * comb(N*M-2, K-2) ans comb(N*M-2, K-2) comb N*M-2 N*M N M 2 K-2 K 2 mod print(ans) print ans ans = 0 0 ans ans = ans * comb(N*M-2, K-2) % mod ans * comb(N*M-2, K-2) % mod ans ans += (i+1)*j*(j+1)//2 + i*(M-j-1)*(M-j)//2 + M*i*(i+1)//2 (i+1)*j*(j+1)//2 + i*(M-j-1)*(M-j)//2 + M*i*(i+1)//2 ans def comb(n, k, mod=10**9+7):
    num = den = 1
    for i in range(k):
        num = num * (n-i) % mod
        den = den * (i+1) % mod
    return num * pow(den, mod-2, mod) % mod def comb(n, k, mod=10**9+7):
    num = den = 1
    for i in range(k):
        num = num * (n-i) % mod
        den = den * (i+1) % mod
    return num * pow(den, mod-2, mod) % mod comb M, K = map(int, input().split()) map(int, input().split()) M ans %= mod mod ans K = map(int, input().split()) map(int, input().split()) K N, M, K = map(int, input().split()) map(int, input().split()) N mod = 10**9 + 7 10**9 + 7 mod
def comb(n, k, mod=10**9+7):
    num = den = 1
    for i in range(k):
        num = num * (n-i) % mod
        den = den * (i+1) % mod
    return num * pow(den, mod-2, mod) % mod

N, M, K = map(int, input().split())
mod = 10**9 + 7
ans = 0
for i in range(N):
    for j in range(M):
        ans += (i+1)*j*(j+1)//2 + i*(M-j-1)*(M-j)//2 + M*i*(i+1)//2
        ans %= mod
ans = ans * comb(N*M-2, K-2) % mod
print(ans)

