#include <bits/stdc++.h>
using namespace std;
long long C[1007][1007];
int main() {
  long long n, m, k;
  memset(C, 0, sizeof(C));
  C[0][0] = 1;
  for (long long i = 1; i <= 1000; i++) {
    C[i][0] = 1;
    for (long long j = 1; j <= i; j++)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000007;
  }
  while (cin >> n >> m >> k) {
    long long a = n - 2 * k - 1;
    long long b = m - 2 * k - 1;
    if (a < 0 || b < 0)
      cout << 0 << endl;
    else
      cout << (C[2 * k + a][a] * C[2 * k + b][b]) % 1000000007 << endl;
  }
  return 0;
}
