#include <bits/stdc++.h>
using namespace std;
const int md = 1e9 + 7;
const int N = 1e3 + 10;
int fac[N], invFac[N];
int mul(int a, int b) { return (a * 1LL * b) % md; }
int fast_exp(int base, int exp) {
  long long res = 1;
  while (exp > 0) {
    if (exp % 2 == 1) res = mul(res, base);
    base = mul(base, base);
    exp /= 2;
  }
  return res;
}
int inv_mod(int a) { return fast_exp(a, md - 2); }
void preprocess() {
  fac[0] = 1;
  for (int i = 1; i < N; i++) fac[i] = mul(i, fac[i - 1]);
  invFac[N - 1] = inv_mod(fac[N - 1]);
  for (int i = N - 2; i >= 0; i--) invFac[i] = mul(i + 1, invFac[i + 1]);
}
int choose(int n, int r) { return mul(fac[n], mul(invFac[r], invFac[n - r])); }
int main() {
  preprocess();
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  n--, m--;
  if (n < 2 * k || m < 2 * k)
    printf("0\n");
  else
    printf("%d\n", mul(choose(n, 2 * k), choose(m, 2 * k)));
}
