#include <bits/stdc++.h>
using namespace std;
int save[2000][2000];
int choose(int n, int k) {
  if (k > n) return 0;
  if (k == n) return 1;
  if (k == 0) return 1;
  if (save[n][k] == -1) {
    save[n][k] = choose(n - 1, k) + choose(n - 1, k - 1);
    save[n][k] %= 1000000007;
  }
  return save[n][k];
}
int main() {
  int N, M, K;
  scanf("%d %d %d", &N, &M, &K);
  memset(save, -1, sizeof(save));
  long long answer = (long long)choose(N - 1, 2 * K) * choose(M - 1, 2 * K);
  printf("%I64d\n", answer % 1000000007);
  return 0;
}
