#include <bits/stdc++.h>
using namespace std;
double eps = 1e-9;
const int INF = 1e9 + 7;
const long long LINF = 1e18 + 7;
const int MOD = 1e9 + 7;
long long binPow(long long x, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = res * x % MOD;
    }
    x = x * x % MOD;
    b >>= 1;
  }
  return res;
}
long long inv(long long x) { return binPow(x, MOD - 2); }
long long C(long long n, long long k) {
  long long res = 1;
  for (int i = 1; i <= k; ++i)
    res = (res * ((n - k + i) % MOD) % MOD) * inv(i) % MOD;
  return res;
}
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  k <<= 1;
  cout << C(n - 1, k) * C(m - 1, k) % MOD << endl;
}
