p,q,r=map(int,input().split())

    
def comb_mod(N,K,modp):

    K_fact=1
    NK_fact=1
    N_fact=1

    for i in range(1,K+1):
        K_fact*=i
        K_fact=K_fact%modp
    for i in range(1,N-K+1):
        NK_fact*=i
        NK_fact=NK_fact%modp
    for i in range(1,N+1):
        N_fact*=i
        N_fact=N_fact%modp

    K_inv=pow(K_fact, -1, modp)
    NK_inv=pow(NK_fact, -1, modp)
    pat=(N_fact*K_inv)%modp*NK_inv%modp
    return pat

pat=comb_mod(p*q-2,r-2,10**9+7)

ans=0
for i in range(0,q+1):
    ans+=i*(q-i)*p*p
    ans=ans%(10**9+7)
    
for k in range(0,p+1):
    ans+=k*(p-k)*q*q%(10**9+7)
    ans=ans%(10**9+7)

print(ans*pat%(10**9+7)) p,q,r=map(int,input().split()) p map(int,input().split()) map int input().split() ().split () input split q r def comb_mod(N,K,modp):

    K_fact=1
    NK_fact=1
    N_fact=1

    for i in range(1,K+1):
        K_fact*=i
        K_fact=K_fact%modp
    for i in range(1,N-K+1):
        NK_fact*=i
        NK_fact=NK_fact%modp
    for i in range(1,N+1):
        N_fact*=i
        N_fact=N_fact%modp

    K_inv=pow(K_fact, -1, modp)
    NK_inv=pow(NK_fact, -1, modp)
    pat=(N_fact*K_inv)%modp*NK_inv%modp
    return pat comb_mod K_fact=1 K_fact 1 NK_fact=1 NK_fact 1 N_fact=1 N_fact 1 for i in range(1,K+1):
        K_fact*=i
        K_fact=K_fact%modp
     i range(1,K+1) range 1 K+1 K 1 K_fact*=i K_fact i K_fact=K_fact%modp K_fact K_fact%modp K_fact modp for i in range(1,N-K+1):
        NK_fact*=i
        NK_fact=NK_fact%modp
     i range(1,N-K+1) range 1 N-K+1 N-K N K 1 NK_fact*=i NK_fact i NK_fact=NK_fact%modp NK_fact NK_fact%modp NK_fact modp for i in range(1,N+1):
        N_fact*=i
        N_fact=N_fact%modp

     i range(1,N+1) range 1 N+1 N 1 N_fact*=i N_fact i N_fact=N_fact%modp N_fact N_fact%modp N_fact modp K_inv=pow(K_fact, -1, modp) K_inv pow(K_fact, -1, modp) pow K_fact -1 modp NK_inv=pow(NK_fact, -1, modp) NK_inv pow(NK_fact, -1, modp) pow NK_fact -1 modp pat=(N_fact*K_inv)%modp*NK_inv%modp pat (N_fact*K_inv)%modp*NK_inv%modp (N_fact*K_inv)%modp*NK_inv (N_fact*K_inv)%modp N_fact*K_inv N_fact K_inv modp NK_inv modp return pat pat N N K K modp modp pat=comb_mod(p*q-2,r-2,10**9+7) pat comb_mod(p*q-2,r-2,10**9+7) comb_mod p*q-2 p*q p q 2 r-2 r 2 10**9+7 10**9 10 9 7 ans=0 ans 0 for i in range(0,q+1):
    ans+=i*(q-i)*p*p
    ans=ans%(10**9+7)
     i range(0,q+1) range 0 q+1 q 1 ans+=i*(q-i)*p*p ans i*(q-i)*p*p i*(q-i)*p i*(q-i) i q-i q i p p ans=ans%(10**9+7) ans ans%(10**9+7) ans 10**9+7 10**9 10 9 7 for k in range(0,p+1):
    ans+=k*(p-k)*q*q%(10**9+7)
    ans=ans%(10**9+7) k range(0,p+1) range 0 p+1 p 1 ans+=k*(p-k)*q*q%(10**9+7) ans k*(p-k)*q*q%(10**9+7) k*(p-k)*q*q k*(p-k)*q k*(p-k) k p-k p k q q 10**9+7 10**9 10 9 7 ans=ans%(10**9+7) ans ans%(10**9+7) ans 10**9+7 10**9 10 9 7 print(ans*pat%(10**9+7)) print ans*pat%(10**9+7) ans*pat ans pat 10**9+7 10**9 10 9 7 q,r=map(int,input().split()) map(int,input().split()) q p,q,r=map(int,input().split()) map(int,input().split()) p r=map(int,input().split()) map(int,input().split()) r def comb_mod(N,K,modp):

    K_fact=1
    NK_fact=1
    N_fact=1

    for i in range(1,K+1):
        K_fact*=i
        K_fact=K_fact%modp
    for i in range(1,N-K+1):
        NK_fact*=i
        NK_fact=NK_fact%modp
    for i in range(1,N+1):
        N_fact*=i
        N_fact=N_fact%modp

    K_inv=pow(K_fact, -1, modp)
    NK_inv=pow(NK_fact, -1, modp)
    pat=(N_fact*K_inv)%modp*NK_inv%modp
    return pat def comb_mod(N,K,modp):

    K_fact=1
    NK_fact=1
    N_fact=1

    for i in range(1,K+1):
        K_fact*=i
        K_fact=K_fact%modp
    for i in range(1,N-K+1):
        NK_fact*=i
        NK_fact=NK_fact%modp
    for i in range(1,N+1):
        N_fact*=i
        N_fact=N_fact%modp

    K_inv=pow(K_fact, -1, modp)
    NK_inv=pow(NK_fact, -1, modp)
    pat=(N_fact*K_inv)%modp*NK_inv%modp
    return pat comb_mod ans=0 0 ans ans+=i*(q-i)*p*p i*(q-i)*p*p ans pat=comb_mod(p*q-2,r-2,10**9+7) comb_mod(p*q-2,r-2,10**9+7) pat ans=ans%(10**9+7) ans%(10**9+7) ans ans+=k*(p-k)*q*q%(10**9+7) k*(p-k)*q*q%(10**9+7) ans ans=ans%(10**9+7) ans%(10**9+7) ans
p,q,r=map(int,input().split())

    
def comb_mod(N,K,modp):

    K_fact=1
    NK_fact=1
    N_fact=1

    for i in range(1,K+1):
        K_fact*=i
        K_fact=K_fact%modp
    for i in range(1,N-K+1):
        NK_fact*=i
        NK_fact=NK_fact%modp
    for i in range(1,N+1):
        N_fact*=i
        N_fact=N_fact%modp

    K_inv=pow(K_fact, -1, modp)
    NK_inv=pow(NK_fact, -1, modp)
    pat=(N_fact*K_inv)%modp*NK_inv%modp
    return pat

pat=comb_mod(p*q-2,r-2,10**9+7)

ans=0
for i in range(0,q+1):
    ans+=i*(q-i)*p*p
    ans=ans%(10**9+7)
    
for k in range(0,p+1):
    ans+=k*(p-k)*q*q%(10**9+7)
    ans=ans%(10**9+7)

print(ans*pat%(10**9+7))