#include <bits/stdc++.h>
using namespace std;
long long c[1001][1001];
int main() {
  int n, m, k, i, j;
  c[0][0] = 1;
  for (i = 1; i <= 1000; i++) {
    c[i][0] = c[i][i] = 1;
    for (j = 1; j < i; j++) {
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % 1000000007;
    }
  }
  while (~scanf("%d%d%d", &n, &m, &k)) {
    if (k + k > n - 1 || k + k > m - 1) {
      puts("0");
      continue;
    }
    long long ans = c[n - 1][k * 2] * c[m - 1][k * 2] % 1000000007;
    cout << ans << endl;
  }
  return 0;
}
