#include <bits/stdc++.h>
const int mod = 1000000007;
int x, y, k;
long long pow(long long a, int x) {
  if (x == 0) return 1;
  long long tp = pow(a, x >> 1);
  (tp *= tp) %= mod;
  if (x & 1) (tp *= a) %= mod;
  return tp;
}
int cc(int n, int m) {
  if (n < m) return 0;
  long long tmp = 1;
  for (int i = n, j = 1; j <= m; i--, j++) {
    (tmp *= i) %= mod;
    (tmp *= pow(j, mod - 2)) %= mod;
  }
  return tmp;
}
int main() {
  scanf("%d%d%d", &x, &y, &k);
  long long a1 = cc(x - 1, k * 2);
  long long a2 = cc(y - 1, k * 2);
  printf("%d\n", (int)(a1 * a2 % mod));
}
