#include <bits/stdc++.h>
using namespace std;
int n, m, K;
int C[2005][2005];
void Init() {
  C[0][0] = 1;
  for (int i = (1), i_end_ = (2005 - 5); i <= i_end_; i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = (1), j_end_ = (i - 1); j <= j_end_; j++) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 1000000007;
    }
  }
}
int main() {
  Init();
  scanf("%d%d%d", &n, &m, &K);
  n -= 1;
  m -= 1;
  if (n < 0 || m < 0)
    puts("0");
  else {
    printf("%lld\n", 1ll * C[n][K * 2] * C[m][K * 2] % 1000000007);
  }
  return 0;
}
