#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long dp[1001][1001];
long long gao(int n, int m) {
  if (~dp[n][m]) return dp[n][m];
  if (!m) return dp[n][m] = 1;
  long long ret = 0;
  for (int i = m * 2 - 1; i <= n - 2; i++)
    ret = (ret + gao(i, m - 1) * (n - 1 - i)) % MOD;
  return dp[n][m] = ret;
}
int main() {
  int n, m, s;
  scanf("%d%d%d", &n, &m, &s);
  memset(dp, 255, sizeof(dp));
  printf("%I64d\n", gao(n, s) * gao(m, s) % MOD);
}
