#include <bits/stdc++.h>

using namespace std;

const int MAX = 200001;
const int MOD = 1000000007;

long long fac[MAX], finv[MAX], inv[MAX];

void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int main(void) {
  COMinit();

  long long N, M, K; cin >> N >> M >> K;
  long long D[N][M];
  
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++) {
      D[i][j] = (i + j) * (N-i) * (M-j) * (i == 0 || j == 0 ? 1 : 2);
    }
  }

  long long ans = 0;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++) {
      ans += D[i][j] * COM(N*M-2, K-2);
      ans %= MOD;
    }
  }

  cout << ans << endl;

  return 0;
}