import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def cmb(n, r, mod=10 ** 9 + 7):
    if r < 0 or n < r:
        return 0
    r = min(r, n - r)
    numerator, denominator = 1, 1
    for i in range(1, r + 1):
        numerator = (numerator * (n + 1 - i)) % mod
        denominator = (denominator * i) % mod
    return numerator * pow(denominator, mod - 2, mod) % mod


def solve():
    N, M, K = map(int, rl().split())
    MOD = 10 ** 9 + 7
    
    ans = 0
    for i in range(N):
        for j in range(M):
            tmp = (N - i) * (M - j) * (i + j) % MOD
            if i != 0 and j != 0:
                tmp *= 2
            ans = (ans + tmp) % MOD
    ans = ans * cmb(N * M - 2, K - 2) % MOD
    print(ans)


if __name__ == '__main__':
    solve() import sys sys sys.setrecursionlimit(10 ** 7) sys.setrecursionlimit sys setrecursionlimit 10 ** 7 10 7 rl = sys.stdin.readline rl sys.stdin.readline sys.stdin sys stdin readline def cmb(n, r, mod=10 ** 9 + 7):
    if r < 0 or n < r:
        return 0
    r = min(r, n - r)
    numerator, denominator = 1, 1
    for i in range(1, r + 1):
        numerator = (numerator * (n + 1 - i)) % mod
        denominator = (denominator * i) % mod
    return numerator * pow(denominator, mod - 2, mod) % mod cmb if r < 0 or n < r:
        return 0
     r < 0 or n < r r < 0 r 0 n < r n r return 0 0 r = min(r, n - r) r min(r, n - r) min r n - r n r numerator, denominator = 1, 1 numerator 1 denominator 1 for i in range(1, r + 1):
        numerator = (numerator * (n + 1 - i)) % mod
        denominator = (denominator * i) % mod
     i range(1, r + 1) range 1 r + 1 r 1 numerator = (numerator * (n + 1 - i)) % mod numerator (numerator * (n + 1 - i)) % mod numerator * (n + 1 - i) numerator n + 1 - i n + 1 n 1 i mod denominator = (denominator * i) % mod denominator (denominator * i) % mod denominator * i denominator i mod return numerator * pow(denominator, mod - 2, mod) % mod numerator * pow(denominator, mod - 2, mod) % mod numerator * pow(denominator, mod - 2, mod) numerator pow(denominator, mod - 2, mod) pow denominator mod - 2 mod 2 mod mod n n r r mod=10 ** 9 + 7 mod 10 ** 9 + 7 10 ** 9 10 9 7 def solve():
    N, M, K = map(int, rl().split())
    MOD = 10 ** 9 + 7
    
    ans = 0
    for i in range(N):
        for j in range(M):
            tmp = (N - i) * (M - j) * (i + j) % MOD
            if i != 0 and j != 0:
                tmp *= 2
            ans = (ans + tmp) % MOD
    ans = ans * cmb(N * M - 2, K - 2) % MOD
    print(ans) solve N, M, K = map(int, rl().split()) N map(int, rl().split()) map int rl().split() ().split () rl 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):
            tmp = (N - i) * (M - j) * (i + j) % MOD
            if i != 0 and j != 0:
                tmp *= 2
            ans = (ans + tmp) % MOD
     i range(N) range N for j in range(M):
            tmp = (N - i) * (M - j) * (i + j) % MOD
            if i != 0 and j != 0:
                tmp *= 2
            ans = (ans + tmp) % MOD
     j range(M) range M tmp = (N - i) * (M - j) * (i + j) % MOD tmp (N - i) * (M - j) * (i + j) % MOD (N - i) * (M - j) * (i + j) (N - i) * (M - j) N - i N i M - j M j i + j i j MOD 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 = (ans + tmp) % MOD ans (ans + tmp) % MOD ans + tmp ans tmp MOD ans = ans * cmb(N * M - 2, K - 2) % MOD ans ans * cmb(N * M - 2, K - 2) % MOD ans * cmb(N * M - 2, K - 2) ans cmb(N * M - 2, K - 2) cmb N * M - 2 N * M N M 2 K - 2 K 2 MOD print(ans) print ans if __name__ == '__main__':
    solve() __name__ == '__main__' __name__ '__main__' solve() solve def cmb(n, r, mod=10 ** 9 + 7):
    if r < 0 or n < r:
        return 0
    r = min(r, n - r)
    numerator, denominator = 1, 1
    for i in range(1, r + 1):
        numerator = (numerator * (n + 1 - i)) % mod
        denominator = (denominator * i) % mod
    return numerator * pow(denominator, mod - 2, mod) % mod def cmb(n, r, mod=10 ** 9 + 7):
    if r < 0 or n < r:
        return 0
    r = min(r, n - r)
    numerator, denominator = 1, 1
    for i in range(1, r + 1):
        numerator = (numerator * (n + 1 - i)) % mod
        denominator = (denominator * i) % mod
    return numerator * pow(denominator, mod - 2, mod) % mod cmb def solve():
    N, M, K = map(int, rl().split())
    MOD = 10 ** 9 + 7
    
    ans = 0
    for i in range(N):
        for j in range(M):
            tmp = (N - i) * (M - j) * (i + j) % MOD
            if i != 0 and j != 0:
                tmp *= 2
            ans = (ans + tmp) % MOD
    ans = ans * cmb(N * M - 2, K - 2) % MOD
    print(ans) def solve():
    N, M, K = map(int, rl().split())
    MOD = 10 ** 9 + 7
    
    ans = 0
    for i in range(N):
        for j in range(M):
            tmp = (N - i) * (M - j) * (i + j) % MOD
            if i != 0 and j != 0:
                tmp *= 2
            ans = (ans + tmp) % MOD
    ans = ans * cmb(N * M - 2, K - 2) % MOD
    print(ans) solve rl = sys.stdin.readline sys.stdin.readline rl
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def cmb(n, r, mod=10 ** 9 + 7):
    if r < 0 or n < r:
        return 0
    r = min(r, n - r)
    numerator, denominator = 1, 1
    for i in range(1, r + 1):
        numerator = (numerator * (n + 1 - i)) % mod
        denominator = (denominator * i) % mod
    return numerator * pow(denominator, mod - 2, mod) % mod


def solve():
    N, M, K = map(int, rl().split())
    MOD = 10 ** 9 + 7
    
    ans = 0
    for i in range(N):
        for j in range(M):
            tmp = (N - i) * (M - j) * (i + j) % MOD
            if i != 0 and j != 0:
                tmp *= 2
            ans = (ans + tmp) % MOD
    ans = ans * cmb(N * M - 2, K - 2) % MOD
    print(ans)


if __name__ == '__main__':
    solve()
