import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7

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

def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret

def f1(x,y,a,b):
    return (a+b-x-y)*(a-x+1)*(b-y+1)//2

def f2(x,a):
    return (a-x)*(a-x+1)//2

ans = 0

for x in range(1,n+1):
    for y in range(1,m+1):
        a = n-x+1
        b = m-y+1
        c = m*(a*(a-1)+x*(x-1))
        d = n*(b*(b-1)+y*(y-1))
        ans += (c+d)//2
        ans %= mod

ans = (ans * comb(m*n-2,k-2,mod))%mod
ans = ans*pow(2,mod-2,mod)%mod

print(ans)
 import sys sys readline = sys.stdin.readline readline sys.stdin.readline sys.stdin sys stdin readline sys.setrecursionlimit(10**8) sys.setrecursionlimit sys setrecursionlimit 10**8 10 8 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 INF = 10**18 INF 10**18 10 18 eps = 10**-7 eps 10**-7 10 -7 m,n,k = map(int,readline().split()) m map(int,readline().split()) map int readline().split() ().split () readline split n k def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret comb r = min(r, n-r) r min(r, n-r) min r n-r n r mol = 1 mol 1 deno = 1 deno 1 for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
     i range(1, r+1) range 1 r+1 r 1 mol = mol * (n-r+i) % mod mol mol * (n-r+i) % mod mol * (n-r+i) mol n-r+i n-r n r i mod deno = deno * i % mod deno deno * i % mod deno * i deno i mod ret = mol * pow(deno, mod-2, mod) % mod ret mol * pow(deno, mod-2, mod) % mod mol * pow(deno, mod-2, mod) mol pow(deno, mod-2, mod) pow deno mod-2 mod 2 mod mod return ret ret n n r r mod mod def f1(x,y,a,b):
    return (a+b-x-y)*(a-x+1)*(b-y+1)//2 f1 return (a+b-x-y)*(a-x+1)*(b-y+1)//2 (a+b-x-y)*(a-x+1)*(b-y+1)//2 (a+b-x-y)*(a-x+1)*(b-y+1) (a+b-x-y)*(a-x+1) a+b-x-y a+b-x a+b a b x y a-x+1 a-x a x 1 b-y+1 b-y b y 1 2 x x y y a a b b def f2(x,a):
    return (a-x)*(a-x+1)//2 f2 return (a-x)*(a-x+1)//2 (a-x)*(a-x+1)//2 (a-x)*(a-x+1) a-x a x a-x+1 a-x a x 1 2 x x a a ans = 0 ans 0 for x in range(1,n+1):
    for y in range(1,m+1):
        a = n-x+1
        b = m-y+1
        c = m*(a*(a-1)+x*(x-1))
        d = n*(b*(b-1)+y*(y-1))
        ans += (c+d)//2
        ans %= mod x range(1,n+1) range 1 n+1 n 1 for y in range(1,m+1):
        a = n-x+1
        b = m-y+1
        c = m*(a*(a-1)+x*(x-1))
        d = n*(b*(b-1)+y*(y-1))
        ans += (c+d)//2
        ans %= mod y range(1,m+1) range 1 m+1 m 1 a = n-x+1 a n-x+1 n-x n x 1 b = m-y+1 b m-y+1 m-y m y 1 c = m*(a*(a-1)+x*(x-1)) c m*(a*(a-1)+x*(x-1)) m a*(a-1)+x*(x-1) a*(a-1) a a-1 a 1 x*(x-1) x x-1 x 1 d = n*(b*(b-1)+y*(y-1)) d n*(b*(b-1)+y*(y-1)) n b*(b-1)+y*(y-1) b*(b-1) b b-1 b 1 y*(y-1) y y-1 y 1 ans += (c+d)//2 ans (c+d)//2 c+d c d 2 ans %= mod ans mod ans = (ans * comb(m*n-2,k-2,mod))%mod ans (ans * comb(m*n-2,k-2,mod))%mod ans * comb(m*n-2,k-2,mod) ans comb(m*n-2,k-2,mod) comb m*n-2 m*n m n 2 k-2 k 2 mod mod ans = ans*pow(2,mod-2,mod)%mod ans ans*pow(2,mod-2,mod)%mod ans*pow(2,mod-2,mod) ans pow(2,mod-2,mod) pow 2 mod-2 mod 2 mod mod print(ans) print ans INF = 10**18 10**18 INF def f2(x,a):
    return (a-x)*(a-x+1)//2 def f2(x,a):
    return (a-x)*(a-x+1)//2 f2 readline = sys.stdin.readline sys.stdin.readline readline m,n,k = map(int,readline().split()) map(int,readline().split()) m d = n*(b*(b-1)+y*(y-1)) n*(b*(b-1)+y*(y-1)) d ans %= mod mod ans ans = (ans * comb(m*n-2,k-2,mod))%mod (ans * comb(m*n-2,k-2,mod))%mod ans k = map(int,readline().split()) map(int,readline().split()) k eps = 10**-7 10**-7 eps mod = 10**9+7 10**9+7 mod a = n-x+1 n-x+1 a ans = 0 0 ans def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret comb def f1(x,y,a,b):
    return (a+b-x-y)*(a-x+1)*(b-y+1)//2 def f1(x,y,a,b):
    return (a+b-x-y)*(a-x+1)*(b-y+1)//2 f1 ans += (c+d)//2 (c+d)//2 ans ans = ans*pow(2,mod-2,mod)%mod ans*pow(2,mod-2,mod)%mod ans b = m-y+1 m-y+1 b n,k = map(int,readline().split()) map(int,readline().split()) n c = m*(a*(a-1)+x*(x-1)) m*(a*(a-1)+x*(x-1)) c
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7

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

def comb(n, r, mod):
    r = min(r, n-r)
    mol = 1
    deno = 1
    for i in range(1, r+1):
        mol = mol * (n-r+i) % mod
        deno = deno * i % mod
    ret = mol * pow(deno, mod-2, mod) % mod
    return ret

def f1(x,y,a,b):
    return (a+b-x-y)*(a-x+1)*(b-y+1)//2

def f2(x,a):
    return (a-x)*(a-x+1)//2

ans = 0

for x in range(1,n+1):
    for y in range(1,m+1):
        a = n-x+1
        b = m-y+1
        c = m*(a*(a-1)+x*(x-1))
        d = n*(b*(b-1)+y*(y-1))
        ans += (c+d)//2
        ans %= mod

ans = (ans * comb(m*n-2,k-2,mod))%mod
ans = ans*pow(2,mod-2,mod)%mod

print(ans)

