#include <bits/stdc++.h>
using namespace std;
long long C[2 * 1000 + 1][2 * 1000 + 1];
int Solve(const int N, const int M, const int K) {
  C[0][0] = 1;
  for (int i = 1; i <= 2 * 1000; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000007;
    }
  }
  return (C[N - 1][2 * K] * C[M - 1][2 * K]) % 1000000007;
}
int main() {
  int N, M, K;
  scanf("%d %d %d", &N, &M, &K);
  printf("%d\n", Solve(N, M, K));
  return 0;
}
