n, m, k = map(int, input().split())

mod = 1000000007
fac = [1]
for i in range(1, n * m + 1):
    fac.append((fac[-1] * i) % mod)

def pow(x, n):
    ret = 1
    while n > 0:
        if (n & 1) == 1:
            ret = (ret * x) % mod
        x = (x * x) % mod
        n >>= 1
    return ret

def inv(i):
    return pow(fac[i], mod - 2)

def cmb(n, k):
    return (fac[n] * inv(k) * inv(n - k)) % mod

x = sum(d * (m - d) for d in range(m)) % mod
y = sum(d * (n - d) for d in range(n)) % mod

c = cmb(n * m - 2, k - 2)
x = (x * n * n * c) % mod
y = (y * m * m * c) % mod

print((x + y) % mod) n, m, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split m k mod = 1000000007 mod 1000000007 fac = [1] fac [1] 1 for i in range(1, n * m + 1):
    fac.append((fac[-1] * i) % mod) i range(1, n * m + 1) range 1 n * m + 1 n * m n m 1 fac.append((fac[-1] * i) % mod) fac.append fac append (fac[-1] * i) % mod fac[-1] * i fac[-1] fac -1 i mod def pow(x, n):
    ret = 1
    while n > 0:
        if (n & 1) == 1:
            ret = (ret * x) % mod
        x = (x * x) % mod
        n >>= 1
    return ret pow ret = 1 ret 1 while n > 0:
        if (n & 1) == 1:
            ret = (ret * x) % mod
        x = (x * x) % mod
        n >>= 1
     n > 0 n 0 if (n & 1) == 1:
            ret = (ret * x) % mod
         (n & 1) == 1 n & 1 n 1 1 ret = (ret * x) % mod ret (ret * x) % mod ret * x ret x mod x = (x * x) % mod x (x * x) % mod x * x x x mod n >>= 1 n 1 return ret ret x x n n def inv(i):
    return pow(fac[i], mod - 2) inv return pow(fac[i], mod - 2) pow(fac[i], mod - 2) pow fac[i] fac i mod - 2 mod 2 i i def cmb(n, k):
    return (fac[n] * inv(k) * inv(n - k)) % mod cmb return (fac[n] * inv(k) * inv(n - k)) % mod (fac[n] * inv(k) * inv(n - k)) % mod fac[n] * inv(k) * inv(n - k) fac[n] * inv(k) fac[n] fac n inv(k) inv k inv(n - k) inv n - k n k mod n n k k x = sum(d * (m - d) for d in range(m)) % mod x sum(d * (m - d) for d in range(m)) % mod sum(d * (m - d) for d in range(m)) sum d * (m - d) d m - d m d mod y = sum(d * (n - d) for d in range(n)) % mod y sum(d * (n - d) for d in range(n)) % mod sum(d * (n - d) for d in range(n)) sum d * (n - d) d n - d n d mod c = cmb(n * m - 2, k - 2) c cmb(n * m - 2, k - 2) cmb n * m - 2 n * m n m 2 k - 2 k 2 x = (x * n * n * c) % mod x (x * n * n * c) % mod x * n * n * c x * n * n x * n x n n c mod y = (y * m * m * c) % mod y (y * m * m * c) % mod y * m * m * c y * m * m y * m y m m c mod print((x + y) % mod) print (x + y) % mod x + y x y mod x = (x * n * n * c) % mod (x * n * n * c) % mod x n, m, k = map(int, input().split()) map(int, input().split()) n def pow(x, n):
    ret = 1
    while n > 0:
        if (n & 1) == 1:
            ret = (ret * x) % mod
        x = (x * x) % mod
        n >>= 1
    return ret def pow(x, n):
    ret = 1
    while n > 0:
        if (n & 1) == 1:
            ret = (ret * x) % mod
        x = (x * x) % mod
        n >>= 1
    return ret pow def inv(i):
    return pow(fac[i], mod - 2) def inv(i):
    return pow(fac[i], mod - 2) inv x = sum(d * (m - d) for d in range(m)) % mod sum(d * (m - d) for d in range(m)) % mod x k = map(int, input().split()) map(int, input().split()) k m, k = map(int, input().split()) map(int, input().split()) m fac = [1] [1] fac def cmb(n, k):
    return (fac[n] * inv(k) * inv(n - k)) % mod def cmb(n, k):
    return (fac[n] * inv(k) * inv(n - k)) % mod cmb mod = 1000000007 1000000007 mod y = (y * m * m * c) % mod (y * m * m * c) % mod y y = sum(d * (n - d) for d in range(n)) % mod sum(d * (n - d) for d in range(n)) % mod y c = cmb(n * m - 2, k - 2) cmb(n * m - 2, k - 2) c
n, m, k = map(int, input().split())

mod = 1000000007
fac = [1]
for i in range(1, n * m + 1):
    fac.append((fac[-1] * i) % mod)

def pow(x, n):
    ret = 1
    while n > 0:
        if (n & 1) == 1:
            ret = (ret * x) % mod
        x = (x * x) % mod
        n >>= 1
    return ret

def inv(i):
    return pow(fac[i], mod - 2)

def cmb(n, k):
    return (fac[n] * inv(k) * inv(n - k)) % mod

x = sum(d * (m - d) for d in range(m)) % mod
y = sum(d * (n - d) for d in range(n)) % mod

c = cmb(n * m - 2, k - 2)
x = (x * n * n * c) % mod
y = (y * m * m * c) % mod

print((x + y) % mod)