#include <bits/stdc++.h>
int power(int a, int b) {
  int p;
  if (b == 0) return 1;
  p = power(a, b / 2);
  p = (long long)p * p % 1000000007;
  if (b % 2 == 1) p = (long long)p * a % 1000000007;
  return p;
}
int inv(int x) { return power(x, 1000000007 - 2); }
int fact(int n, int is_inv) {
  return n == 0 ? 1
                : (long long)fact(n - 1, is_inv) * (is_inv ? inv(n) : n) %
                      1000000007;
}
int choose(int n, int k) {
  return (long long)((long long)fact(n, 0) * fact(k, 1) % 1000000007) *
         fact(n - k, 1) % 1000000007;
}
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  printf("%lld\n", n - 1 < 2 * k || m - 1 < 2 * k
                       ? 0
                       : (long long)choose(n - 1, 2 * k) *
                             choose(m - 1, 2 * k) % 1000000007);
  return 0;
}
