#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int C[1005][1005];
void build() {
  C[0][0] = 1;
  for (int i = 1; i <= 1000; i++) {
    C[i][0] = 1;
    for (int j = 1; j <= 1000; j++) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
    }
  }
}
int main() {
  build();
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  if (2 * k > n - 1 || 2 * k > m - 1) {
    printf("0\n");
  } else {
    printf("%d\n", 1LL * C[n - 1][2 * k] * C[m - 1][2 * k] % mod);
  }
  return 0;
}
