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

mod = 1000000007
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

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

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

def doit(n, m, k):
    ret = 0
    for d in range(m):
        ret = (ret + d * (m - d)) % mod
    return (ret * n * n * cmb(n * m - 2, k - 2)) % mod

print((doit(n, m, k) + doit(m, n, k)) % 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 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 fac = [1] fac [1] 1 inv = [1] inv [1] 1 for i in range(1, n * m + 1):
    fac.append((fac[-1] * i) % mod)
    inv.append(pow(fac[i], mod - 2)) 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 inv.append(pow(fac[i], mod - 2)) inv.append inv append pow(fac[i], mod - 2) pow fac[i] fac i mod - 2 mod 2 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 def doit(n, m, k):
    ret = 0
    for d in range(m):
        ret = (ret + d * (m - d)) % mod
    return (ret * n * n * cmb(n * m - 2, k - 2)) % mod doit ret = 0 ret 0 for d in range(m):
        ret = (ret + d * (m - d)) % mod
     d range(m) range m ret = (ret + d * (m - d)) % mod ret (ret + d * (m - d)) % mod ret + d * (m - d) ret d * (m - d) d m - d m d mod return (ret * n * n * cmb(n * m - 2, k - 2)) % mod (ret * n * n * cmb(n * m - 2, k - 2)) % mod ret * n * n * cmb(n * m - 2, k - 2) ret * n * n ret * n ret n n cmb(n * m - 2, k - 2) cmb n * m - 2 n * m n m 2 k - 2 k 2 mod n n m m k k print((doit(n, m, k) + doit(m, n, k)) % mod) print (doit(n, m, k) + doit(m, n, k)) % mod doit(n, m, k) + doit(m, n, k) doit(n, m, k) doit n m k doit(m, n, k) doit m n k mod k = map(int, input().split()) map(int, input().split()) k 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 n, m, k = map(int, input().split()) map(int, input().split()) n m, k = map(int, input().split()) map(int, input().split()) m fac = [1] [1] fac inv = [1] [1] inv 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 doit(n, m, k):
    ret = 0
    for d in range(m):
        ret = (ret + d * (m - d)) % mod
    return (ret * n * n * cmb(n * m - 2, k - 2)) % mod def doit(n, m, k):
    ret = 0
    for d in range(m):
        ret = (ret + d * (m - d)) % mod
    return (ret * n * n * cmb(n * m - 2, k - 2)) % mod doit mod = 1000000007 1000000007 mod
n, m, k = map(int, input().split())

mod = 1000000007
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

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

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

def doit(n, m, k):
    ret = 0
    for d in range(m):
        ret = (ret + d * (m - d)) % mod
    return (ret * n * n * cmb(n * m - 2, k - 2)) % mod

print((doit(n, m, k) + doit(m, n, k)) % mod)