#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 10;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
long long dp[MAXN][MAXN * 2];
void solve(void) {
  dp[0][0] = 1;
  for (int i = 0; i <= 1000; ++i) {
    dp[i][0] = dp[i][i] = 1;
    for (int j = 1; j < i; ++j) {
      dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % MOD;
    }
  }
}
int main(void) {
  solve();
  int n, m, k;
  while (scanf("%d%d%d", &n, &m, &k) == 3) {
    printf("%I64d\n", (dp[n - 1][2 * k] * dp[m - 1][2 * k]) % MOD);
  }
  return 0;
}
