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