#include <bits/stdc++.h>
using namespace std;
long long fact[1003];
long long bigmod(long long b, long long p) {
  if (!p) return 1ll;
  long long ret = bigmod(b, p / 2);
  ret = (ret * ret) % 1000000007ll;
  if (p & 1ll) ret = (ret * b) % 1000000007ll;
  return ret;
}
long long ncr(int n, int r) {
  if (r > n) return 0;
  return (fact[n] *
          bigmod((fact[r] * fact[n - r]) % 1000000007ll, 1000000007ll - 2)) %
         1000000007ll;
}
int main() {
  fact[0] = 1ll;
  for (int i = 1; i <= 1000; i++) fact[i] = (fact[i - 1] * i) % 1000000007ll;
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  printf("%lld\n", (ncr(n - 1, 2 * k) * ncr(m - 1, 2 * k)) % 1000000007ll);
  return 0;
}
