#include<iostream>
using namespace std;
int p = 1000000007;
int log2_p_MAX = 32;
long long felmer(long long a)
{
  long long rem[log2_p_MAX];
  rem[0] = a%p;
  for(int i=1;i<log2_p_MAX;i++)
    rem[i] = (rem[i-1]*rem[i-1])%p;
  long long res = 1;
  long long expo = p-2;
  for(int i=0;i<log2_p_MAX;i++){
	if(expo%2==1){
      res *= rem[i];
      res = res%p;
    }
  	expo /= 2;
  }
  return res;
}
int main()
{
  long long n,m,k,mn,i,res;
  cin >> n >> m >> k;
  res=m*n*(m*(n-1)*(n+1)+n*(m-1)*(m+1));
  res%=p;
  res*=felmer(6);
  res%=p;
  mn=m*n-2;
  k-=2;
  for(i=1;i<=k;i++){
    res*=mn-i+1;
    res%=p;
    res*=felmer(i);
    res%=p;
  }
  cout << res << endl;
  return 0;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E17;

#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
///////////////////////////////////////
#define N 500004

ll kai[N];
ll kai2[N];
ll po(ll i,ll p){
    if(p==0)return 1;
    else if(p==1)return mod(i);
    else if(p%2==0)return po(mod(mod(i)*mod(i)),p/2);
    else  return mod(mod(i)*po(i,p-1));
}
void calc(){
    kai[0]=1;
    kai2[0]=1;
    rep(i,1,N-1){
        kai[i]=mod(kai[i-1]*i);
    }
    kai2[N-1]=po(kai[N-1],i_5);
    for(ll i=N-2;i>=0;i--){
        kai2[i]=mod(kai2[i+1]*(i+1));
    }
}
ll comb(ll n,ll k){
    if(n<k)return 0;
    else if(n==0)return 1;
    else return mod(mod(kai[n]*kai2[n-k])*kai2[k]);
}
ll bunbo(ll n){
    return po(n,i_5);
}


int main(){fastio
    calc();
    ll n,m,k;cin>>n>>m>>k;
    ll last=kai2[k-2];
    ll nowu=mod(n*m-2);
    rep(i,1,k-2){
        last=mod(last*nowu);
        nowu--;
        if(nowu<0)nowu=mod(nowu);
    }
    ll s[N];s[0]=0;rep(i,1,N-1)s[i]=s[i-1]+i;
    ll sum1=0,sum2=0;
    rep(i,1,m){
        sum1+=s[i-1]+s[m-i];
    }
    sum1=mod(mod(sum1*n)*n);
    rep(i,1,n){
        sum2+=s[i-1]+s[n-i];
    }
    sum2=mod(mod(sum2*m)*m);
    
    //cout<<sum1<<" "<<sum2<<endl;
    sum1=mod(sum1+sum2);
    last=mod(last*sum1);
    last=mod(last*bunbo(2));
    cout<<last<<endl;
    
    return 0;
}


