#include <iostream>

using ll = long long int;

constexpr ll mod = (1e9)+7;
constexpr int MAX = 2*1e5+10;

ll fac[MAX];

void init() {
	fac[0]=1;
	for(int i=1;i<MAX;++i)
		fac[i]=(fac[i-1]*i)%mod;
}

ll inv(ll x){
	ll n = mod-2;
	ll y = 1;
	ll z = 1;
	for(int i=0;i<40;++i){
		if(n&y) z = (z*x)%mod; 
		x=(x*x)%mod;
		y*=2;
	}
	return z;
}

ll func(ll x, ll y) {
	return ((x*(x+1)/2%mod)*y%mod + (y*(y+1)/2%mod)*x%mod)%mod;
}

ll g(ll x){return x*(x+1)/2%mod;}

int main(){
	init();
	int n, m, k;
	std::cin>>n>>m>>k;

	ll comb = (fac[n*m-2] * inv(fac[k-2]) % mod) * inv(fac[n*m-k]) % mod;

	ll sum = 0;

	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			sum+=func(i-1,j-1)+func(i-1,m-j)+func(n-i,j-1)+func(n-i,m-j)+g(i-1)+g(j-1)+g(m-j)+g(n-i);
			sum%=mod;
		}
	}
	

	std::cout<<((comb*sum)%mod)*inv(2)%mod<<std::endl;

	return 0;
}

#include<bits/stdc++.h>

using namespace std;

typedef long long int ll;

const int mod = 1e9 + 7;

ll pwr (ll a, ll b) {
  ll res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}

ll inv (ll a) {
  return pwr (a, mod - 2);
}

ll nCr (ll n, ll r) {
  ll ans = 1;
  for (int i = 0; i < r; i++) ans = (ans * (n - i)) % mod;
  for (int i = 1; i <= r; i++) ans = (ans * inv (i)) % mod;

  return ans;
}

int main () {
  ios_base::sync_with_stdio(false);
  cin.tie(0);cout.tie(0);

  int n, m;
  ll k;
  cin >> n >> m >> k;

  ll ans = 0;
  for (int i = 1; i <= m; i++) {
    ans += (((ll)(m - i) * (m - i + 1)) / 2);
    ans %= mod;
  }
  ll a = (((ll)n * (n - 1)) + n) % mod;
  ans = (ans * a) % mod;
  ll tmp_ans = 0;
  for (int i = 1; i <= n; i++) {
    tmp_ans += (((ll)(n - i) * (n - i + 1)) / 2);
    tmp_ans %= mod;
  }
  ll b = (((ll)m * (m - 1)) + m) % mod;
  tmp_ans = (tmp_ans * b) % mod;

  ans = (ans + tmp_ans) % mod;

  ans = (ans * nCr ((ll)n * m - 2, k - 2)) % mod;

  cout << ans << '\n';
}
