#include <bits/stdc++.h>
using namespace std;
int N, M, K;
long long C[1005][2005];
int main() {
  scanf("%d %d %d", &N, &M, &K);
  int D = max(N, M);
  C[0][0] = 1;
  for (int i = 1; i <= D; ++i) {
    C[i][0] = 1;
    for (int j = 1; j <= i; ++j) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 1000000007;
    }
  }
  long long res = (C[N - 1][2 * K] * C[M - 1][2 * K]) % 1000000007;
  cout << res << endl;
  return 0;
}
