#include <bits/stdc++.h>
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
using namespace std;
long long f[MAXN];
long long bin_pow(long long a, long long b) {
  long long r = 1;
  while (b) {
    if (b & 1) r = (r * a) % MOD;
    a = (a * a) % MOD;
    b /= 2ll;
  }
  return r;
}
long long ncr(int n, int k) {
  return (f[n] * bin_pow(f[k], MOD - 2) % MOD) * bin_pow(f[n - k], MOD - 2) %
         MOD;
}
int main() {
  f[0] = 1;
  for (long long i = 1; i < MAXN; i++) f[i] = f[i - 1] * i % MOD;
  int n, m, k;
  scanf("%d", &(n)), scanf("%d", &(m)), scanf("%d", &(k));
  if (k * 2 > min(n, m) - 1) return !printf("%d\n", (0));
  printf("%I64d\n", (ncr(n - 1, 2 * k) * ncr(m - 1, 2 * k) % MOD));
  return 0;
}
