#include <bits/stdc++.h>
using namespace std;
const long long base = 1e9 + 7;
int n, m, k;
long long C[2005][2005];
int main() {
  C[0][0] = 1;
  for (int i = 1; i <= 2000; ++i) {
    C[i][0] = 1;
    for (int j = 1; j <= i; ++j)
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % base;
  }
  scanf("%d%d%d", &n, &m, &k);
  printf("%I64d",
         ((long long)C[n - 1][k << 1] * (long long)C[m - 1][k << 1]) % base);
  return 0;
}
