#include <bits/stdc++.h>
using namespace std;
long long modx(long long Base, long long exponent) {
  long long ans = 1;
  if (Base == 1) return Base;
  while (exponent) {
    if (exponent & 1) ans = (ans * Base) % 1000000007;
    Base = (Base * Base) % 1000000007;
    exponent = exponent >> 1;
  }
  return ans;
}
long long inmodx(long long num) { return (modx(num, 1000000007 - 2LL)); }
bool cmp() {
  bool ans = 0;
  return ans;
}
struct ST_Node {
  ST_Node() { return; }
  void assign_value_(int val) { return; }
  void merge_nodes_(ST_Node& left, ST_Node& right) { return; }
};
const int N = (1e3) + 9;
const int M = (N << 1) + 9;
const int LOGN = ((int)log2(N)) + 3;
const int LOGM = ((int)log2(M)) + 3;
long long fact[N], ifact[N];
void pre_fact() {
  int i;
  fact[0] = ifact[0] = 1LL;
  for (i = (1); i < (N); i++) {
    fact[i] = (fact[i - 1] * ((long long)i)) % 1000000007;
    ifact[i] = inmodx(fact[i]);
  }
  return;
}
long long choose(int n, int r) {
  if (n < 0 || r < 0 || r > n) return 0LL;
  long long ans = (fact[n] * ifact[r]) % 1000000007;
  ans = (ans * ifact[n - r]) % 1000000007;
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  pre_fact();
  int n, m, k;
  long long ans;
  cin >> n >> m >> k;
  ans = (choose(n - 1, k + k) * choose(m - 1, k + k)) % 1000000007;
  cout << ans;
  return 0;
}
