def power_mod(a,b,mod=10**9+7):
    i,temp,box=0,b,[]
    while(2**i<=b):
        i+=1
    for j in range(i-1,-1,-1):
        box=[[j,temp//2**j]]+box
        temp-=2**j*(temp//2**j)
    box[0].append(a)
    ans=box[0][1]*a%mod
    for j in range(1,i):
        box[j].append(box[j-1][2]**2%mod)
        if box[j][1]==1:
            ans=(ans*box[j][2])%mod
    return ans
def n_func(n,mod=10**9+7):
    ans=1
    for i in range(1,n+1):
        ans=(ans*i)%mod
    return ans
def nPr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod
def nCr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)*n_func(r,mod)%mod
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod

N,M,K=map(int,input().split())
keisuu=nCr(N*M-2,K-2)
mod=10**9+7

sum_=0
for i in range(N):
    a=min(abs(i),abs(N-i-1))
    b=max(abs(i),abs(N-i-1))
    sum_+=(M**2)*((a*(a+1)//2)+(b*(b+1)//2))
for i in range(M):
    a=min(abs(i),abs(M-i-1))
    b=max(abs(i),abs(M-i-1))
    sum_+=(N**2)*((a*(a+1)//2)+(b*(b+1)//2))
print((keisuu * (sum_//2))%mod) def power_mod(a,b,mod=10**9+7):
    i,temp,box=0,b,[]
    while(2**i<=b):
        i+=1
    for j in range(i-1,-1,-1):
        box=[[j,temp//2**j]]+box
        temp-=2**j*(temp//2**j)
    box[0].append(a)
    ans=box[0][1]*a%mod
    for j in range(1,i):
        box[j].append(box[j-1][2]**2%mod)
        if box[j][1]==1:
            ans=(ans*box[j][2])%mod
    return ans power_mod i,temp,box=0,b,[] i 0 temp b box [] while(2**i<=b):
        i+=1
     2**i<=b 2**i 2 i b i+=1 i 1 for j in range(i-1,-1,-1):
        box=[[j,temp//2**j]]+box
        temp-=2**j*(temp//2**j)
     j range(i-1,-1,-1) range i-1 i 1 -1 -1 box=[[j,temp//2**j]]+box box [[j,temp//2**j]]+box [[j,temp//2**j]] [j,temp//2**j] j temp//2**j temp 2**j 2 j box temp-=2**j*(temp//2**j) temp 2**j*(temp//2**j) 2**j 2 j temp//2**j temp 2**j 2 j box[0].append(a) [0].append [0] box 0 append a ans=box[0][1]*a%mod ans box[0][1]*a%mod box[0][1]*a box[0][1] [0] box 0 1 a mod for j in range(1,i):
        box[j].append(box[j-1][2]**2%mod)
        if box[j][1]==1:
            ans=(ans*box[j][2])%mod
     j range(1,i) range 1 i box[j].append(box[j-1][2]**2%mod) [j].append [j] box j append box[j-1][2]**2%mod box[j-1][2]**2 box[j-1][2] [j-1] box j-1 j 1 2 2 mod if box[j][1]==1:
            ans=(ans*box[j][2])%mod
     box[j][1]==1 box[j][1] [j] box j 1 1 ans=(ans*box[j][2])%mod ans (ans*box[j][2])%mod ans*box[j][2] ans box[j][2] [j] box j 2 mod return ans ans a a b b mod=10**9+7 mod 10**9+7 10**9 10 9 7 def n_func(n,mod=10**9+7):
    ans=1
    for i in range(1,n+1):
        ans=(ans*i)%mod
    return ans n_func ans=1 ans 1 for i in range(1,n+1):
        ans=(ans*i)%mod
     i range(1,n+1) range 1 n+1 n 1 ans=(ans*i)%mod ans (ans*i)%mod ans*i ans i mod return ans ans n n mod=10**9+7 mod 10**9+7 10**9 10 9 7 def nPr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod nPr ans=n_func(n-r,mod) ans n_func(n-r,mod) n_func n-r n r mod ans=power_mod(ans,mod-2,mod) ans power_mod(ans,mod-2,mod) power_mod ans mod-2 mod 2 mod return ans*n_func(n,mod)%mod ans*n_func(n,mod)%mod ans*n_func(n,mod) ans n_func(n,mod) n_func n mod mod n n r r mod=10**9+7 mod 10**9+7 10**9 10 9 7 def nCr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)*n_func(r,mod)%mod
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod nCr ans=n_func(n-r,mod)*n_func(r,mod)%mod ans n_func(n-r,mod)*n_func(r,mod)%mod n_func(n-r,mod)*n_func(r,mod) n_func(n-r,mod) n_func n-r n r mod n_func(r,mod) n_func r mod mod ans=power_mod(ans,mod-2,mod) ans power_mod(ans,mod-2,mod) power_mod ans mod-2 mod 2 mod return ans*n_func(n,mod)%mod ans*n_func(n,mod)%mod ans*n_func(n,mod) ans n_func(n,mod) n_func n mod mod n n r r mod=10**9+7 mod 10**9+7 10**9 10 9 7 N,M,K=map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split M K keisuu=nCr(N*M-2,K-2) keisuu nCr(N*M-2,K-2) nCr N*M-2 N*M N M 2 K-2 K 2 mod=10**9+7 mod 10**9+7 10**9 10 9 7 sum_=0 sum_ 0 for i in range(N):
    a=min(abs(i),abs(N-i-1))
    b=max(abs(i),abs(N-i-1))
    sum_+=(M**2)*((a*(a+1)//2)+(b*(b+1)//2)) i range(N) range N a=min(abs(i),abs(N-i-1)) a min(abs(i),abs(N-i-1)) min abs(i) abs i abs(N-i-1) abs N-i-1 N-i N i 1 b=max(abs(i),abs(N-i-1)) b max(abs(i),abs(N-i-1)) max abs(i) abs i abs(N-i-1) abs N-i-1 N-i N i 1 sum_+=(M**2)*((a*(a+1)//2)+(b*(b+1)//2)) sum_ (M**2)*((a*(a+1)//2)+(b*(b+1)//2)) M**2 M 2 (a*(a+1)//2)+(b*(b+1)//2) a*(a+1)//2 a*(a+1) a a+1 a 1 2 b*(b+1)//2 b*(b+1) b b+1 b 1 2 for i in range(M):
    a=min(abs(i),abs(M-i-1))
    b=max(abs(i),abs(M-i-1))
    sum_+=(N**2)*((a*(a+1)//2)+(b*(b+1)//2)) i range(M) range M a=min(abs(i),abs(M-i-1)) a min(abs(i),abs(M-i-1)) min abs(i) abs i abs(M-i-1) abs M-i-1 M-i M i 1 b=max(abs(i),abs(M-i-1)) b max(abs(i),abs(M-i-1)) max abs(i) abs i abs(M-i-1) abs M-i-1 M-i M i 1 sum_+=(N**2)*((a*(a+1)//2)+(b*(b+1)//2)) sum_ (N**2)*((a*(a+1)//2)+(b*(b+1)//2)) N**2 N 2 (a*(a+1)//2)+(b*(b+1)//2) a*(a+1)//2 a*(a+1) a a+1 a 1 2 b*(b+1)//2 b*(b+1) b b+1 b 1 2 print((keisuu * (sum_//2))%mod) print (keisuu * (sum_//2))%mod keisuu * (sum_//2) keisuu sum_//2 sum_ 2 mod K=map(int,input().split()) map(int,input().split()) K def nPr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod def nPr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod nPr def n_func(n,mod=10**9+7):
    ans=1
    for i in range(1,n+1):
        ans=(ans*i)%mod
    return ans def n_func(n,mod=10**9+7):
    ans=1
    for i in range(1,n+1):
        ans=(ans*i)%mod
    return ans n_func keisuu=nCr(N*M-2,K-2) nCr(N*M-2,K-2) keisuu def power_mod(a,b,mod=10**9+7):
    i,temp,box=0,b,[]
    while(2**i<=b):
        i+=1
    for j in range(i-1,-1,-1):
        box=[[j,temp//2**j]]+box
        temp-=2**j*(temp//2**j)
    box[0].append(a)
    ans=box[0][1]*a%mod
    for j in range(1,i):
        box[j].append(box[j-1][2]**2%mod)
        if box[j][1]==1:
            ans=(ans*box[j][2])%mod
    return ans def power_mod(a,b,mod=10**9+7):
    i,temp,box=0,b,[]
    while(2**i<=b):
        i+=1
    for j in range(i-1,-1,-1):
        box=[[j,temp//2**j]]+box
        temp-=2**j*(temp//2**j)
    box[0].append(a)
    ans=box[0][1]*a%mod
    for j in range(1,i):
        box[j].append(box[j-1][2]**2%mod)
        if box[j][1]==1:
            ans=(ans*box[j][2])%mod
    return ans power_mod M,K=map(int,input().split()) map(int,input().split()) M sum_+=(N**2)*((a*(a+1)//2)+(b*(b+1)//2)) (N**2)*((a*(a+1)//2)+(b*(b+1)//2)) sum_ def nCr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)*n_func(r,mod)%mod
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod def nCr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)*n_func(r,mod)%mod
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod nCr b=max(abs(i),abs(N-i-1)) max(abs(i),abs(N-i-1)) b N,M,K=map(int,input().split()) map(int,input().split()) N a=min(abs(i),abs(M-i-1)) min(abs(i),abs(M-i-1)) a b=max(abs(i),abs(M-i-1)) max(abs(i),abs(M-i-1)) b mod=10**9+7 10**9+7 mod sum_+=(M**2)*((a*(a+1)//2)+(b*(b+1)//2)) (M**2)*((a*(a+1)//2)+(b*(b+1)//2)) sum_ sum_=0 0 sum_ a=min(abs(i),abs(N-i-1)) min(abs(i),abs(N-i-1)) a
def power_mod(a,b,mod=10**9+7):
    i,temp,box=0,b,[]
    while(2**i<=b):
        i+=1
    for j in range(i-1,-1,-1):
        box=[[j,temp//2**j]]+box
        temp-=2**j*(temp//2**j)
    box[0].append(a)
    ans=box[0][1]*a%mod
    for j in range(1,i):
        box[j].append(box[j-1][2]**2%mod)
        if box[j][1]==1:
            ans=(ans*box[j][2])%mod
    return ans
def n_func(n,mod=10**9+7):
    ans=1
    for i in range(1,n+1):
        ans=(ans*i)%mod
    return ans
def nPr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod
def nCr(n,r,mod=10**9+7):
    ans=n_func(n-r,mod)*n_func(r,mod)%mod
    ans=power_mod(ans,mod-2,mod)
    return ans*n_func(n,mod)%mod

N,M,K=map(int,input().split())
keisuu=nCr(N*M-2,K-2)
mod=10**9+7

sum_=0
for i in range(N):
    a=min(abs(i),abs(N-i-1))
    b=max(abs(i),abs(N-i-1))
    sum_+=(M**2)*((a*(a+1)//2)+(b*(b+1)//2))
for i in range(M):
    a=min(abs(i),abs(M-i-1))
    b=max(abs(i),abs(M-i-1))
    sum_+=(N**2)*((a*(a+1)//2)+(b*(b+1)//2))
print((keisuu * (sum_//2))%mod)