#include <bits/stdc++.h>
using namespace std;
int n, m, k;
long long c[1010][1010];
int mod = 1000000007;
int main() {
  int i, j, k;
  memset(c, 0, sizeof(c));
  for (i = 1; i <= 1000; i++) {
    for (j = 0; j <= i; j++) {
      if (j == 0 || i == j) {
        c[i][j] = 1;
      } else {
        c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
        c[i][j] %= mod;
      }
    }
  }
  while (scanf("%d%d%d", &n, &m, &k) != EOF) {
    if (2 * k > n - 1 || 2 * k > m - 1) {
      printf("0\n");
      continue;
    }
    long long res = 1;
    res = c[n - 1][2 * k];
    res *= c[m - 1][2 * k];
    res %= mod;
    cout << res << endl;
  }
  return 0;
}
