import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque, Counter
def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math
INF = 10 ** 20
MOD = 10**9 + 7
def combmod(n, k, mod=MOD):
    if k == 0:
        return 1
    if k == 1:
        return n
    ret = 1
    for i in range(n - k + 1, n + 1):
        ret *= i
        ret %= mod

    for i in range(1, k + 1):
        ret *= pow(i, mod - 2, mod)
        ret %= mod

    return ret

def main():
    n, m, k = getList()
    ans = 0
    mul = combmod(n*m-2, k-2)
    for i in range(0, n):
        for j in range(0, m):
            tmp = (j+i) * (n-i) * (m-j) * mul
            if i != 0 and j != 0:
                tmp *= 2
            ans += tmp
            ans %= MOD
            # print(ans,mul)

    print(ans)
if __name__ == "__main__":
    main()
 import sys sys input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline sys.setrecursionlimit(1000000) sys.setrecursionlimit sys setrecursionlimit 1000000 from collections import deque, Counter def getN():
    return int(input()) getN return int(input()) int(input()) int input() input def getList():
    return list(map(int, input().split())) getList return list(map(int, input().split())) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split import math math INF = 10 ** 20 INF 10 ** 20 10 20 MOD = 10**9 + 7 MOD 10**9 + 7 10**9 10 9 7 def combmod(n, k, mod=MOD):
    if k == 0:
        return 1
    if k == 1:
        return n
    ret = 1
    for i in range(n - k + 1, n + 1):
        ret *= i
        ret %= mod

    for i in range(1, k + 1):
        ret *= pow(i, mod - 2, mod)
        ret %= mod

    return ret combmod if k == 0:
        return 1
     k == 0 k 0 return 1 1 if k == 1:
        return n
     k == 1 k 1 return n n ret = 1 ret 1 for i in range(n - k + 1, n + 1):
        ret *= i
        ret %= mod

     i range(n - k + 1, n + 1) range n - k + 1 n - k n k 1 n + 1 n 1 ret *= i ret i ret %= mod ret mod for i in range(1, k + 1):
        ret *= pow(i, mod - 2, mod)
        ret %= mod

     i range(1, k + 1) range 1 k + 1 k 1 ret *= pow(i, mod - 2, mod) ret pow(i, mod - 2, mod) pow i mod - 2 mod 2 mod ret %= mod ret mod return ret ret n n k k mod=MOD mod MOD def main():
    n, m, k = getList()
    ans = 0
    mul = combmod(n*m-2, k-2)
    for i in range(0, n):
        for j in range(0, m):
            tmp = (j+i) * (n-i) * (m-j) * mul
            if i != 0 and j != 0:
                tmp *= 2
            ans += tmp
            ans %= MOD
            # print(ans,mul)

    print(ans) main n, m, k = getList() n getList() getList m k ans = 0 ans 0 mul = combmod(n*m-2, k-2) mul combmod(n*m-2, k-2) combmod n*m-2 n*m n m 2 k-2 k 2 for i in range(0, n):
        for j in range(0, m):
            tmp = (j+i) * (n-i) * (m-j) * mul
            if i != 0 and j != 0:
                tmp *= 2
            ans += tmp
            ans %= MOD
            # print(ans,mul)

     i range(0, n) range 0 n for j in range(0, m):
            tmp = (j+i) * (n-i) * (m-j) * mul
            if i != 0 and j != 0:
                tmp *= 2
            ans += tmp
            ans %= MOD
            # print(ans,mul)

     j range(0, m) range 0 m tmp = (j+i) * (n-i) * (m-j) * mul tmp (j+i) * (n-i) * (m-j) * mul (j+i) * (n-i) * (m-j) (j+i) * (n-i) j+i j i n-i n i m-j m j mul if i != 0 and j != 0:
                tmp *= 2
             i != 0 and j != 0 i != 0 i 0 j != 0 j 0 tmp *= 2 tmp 2 ans += tmp ans tmp ans %= MOD ans MOD print(ans) print ans if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" main() main def main():
    n, m, k = getList()
    ans = 0
    mul = combmod(n*m-2, k-2)
    for i in range(0, n):
        for j in range(0, m):
            tmp = (j+i) * (n-i) * (m-j) * mul
            if i != 0 and j != 0:
                tmp *= 2
            ans += tmp
            ans %= MOD
            # print(ans,mul)

    print(ans) def main():
    n, m, k = getList()
    ans = 0
    mul = combmod(n*m-2, k-2)
    for i in range(0, n):
        for j in range(0, m):
            tmp = (j+i) * (n-i) * (m-j) * mul
            if i != 0 and j != 0:
                tmp *= 2
            ans += tmp
            ans %= MOD
            # print(ans,mul)

    print(ans) main MOD = 10**9 + 7 10**9 + 7 MOD def getN():
    return int(input()) def getN():
    return int(input()) getN INF = 10 ** 20 10 ** 20 INF input = sys.stdin.readline sys.stdin.readline input def combmod(n, k, mod=MOD):
    if k == 0:
        return 1
    if k == 1:
        return n
    ret = 1
    for i in range(n - k + 1, n + 1):
        ret *= i
        ret %= mod

    for i in range(1, k + 1):
        ret *= pow(i, mod - 2, mod)
        ret %= mod

    return ret def combmod(n, k, mod=MOD):
    if k == 0:
        return 1
    if k == 1:
        return n
    ret = 1
    for i in range(n - k + 1, n + 1):
        ret *= i
        ret %= mod

    for i in range(1, k + 1):
        ret *= pow(i, mod - 2, mod)
        ret %= mod

    return ret combmod def getList():
    return list(map(int, input().split())) def getList():
    return list(map(int, input().split())) getList
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque, Counter
def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math
INF = 10 ** 20
MOD = 10**9 + 7
def combmod(n, k, mod=MOD):
    if k == 0:
        return 1
    if k == 1:
        return n
    ret = 1
    for i in range(n - k + 1, n + 1):
        ret *= i
        ret %= mod

    for i in range(1, k + 1):
        ret *= pow(i, mod - 2, mod)
        ret %= mod

    return ret

def main():
    n, m, k = getList()
    ans = 0
    mul = combmod(n*m-2, k-2)
    for i in range(0, n):
        for j in range(0, m):
            tmp = (j+i) * (n-i) * (m-j) * mul
            if i != 0 and j != 0:
                tmp *= 2
            ans += tmp
            ans %= MOD
            # print(ans,mul)

    print(ans)
if __name__ == "__main__":
    main()

