#include <bits/stdc++.h>
using namespace std;
long long INFLL = (long long)2e18, MOD = 1e9 + 7;
inline long long mexp(long long x, long long n, long long m = MOD) {
  long long res = 1;
  x %= m;
  while (n) {
    if (n & 1) res = (res * x) % m;
    n >>= 1;
    x = (x * x) % m;
  }
  return res;
}
int32_t main(void) {
  long long n, m, k, inv = 1;
  cin >> n >> m >> k;
  if (2 * k >= n || 2 * k >= m) {
    cout << 0 << '\n';
    return 0;
  }
  long long res = 1;
  for (int i = 1; i <= 2 * k; ++i) {
    res = (res * (n - i) * (m - i)) % MOD;
    inv = (inv * i) % MOD;
  }
  inv = mexp(inv, MOD - 2, MOD);
  inv = (inv * inv) % MOD;
  cout << (res * inv) % MOD << '\n';
  return 0;
}
