#include <bits/stdc++.h>
const int MOD = 1000000007;
long long C[1 << 10][1 << 11];
void init() {
  C[0][0] = 1;
  for (int i = 0; i < (1 << 10); i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
  }
}
int main() {
  init();
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  printf("%lld\n", (C[n - 1][2 * k] * C[m - 1][2 * k]) % MOD);
  return 0;
}
