#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long dp[1001][1001];
long long solve(int N, int K) {
  if (dp[N][K] != -1) return dp[N][K];
  if (K == 0) return dp[N][K] = 1;
  if (N <= 2 * K) return dp[N][K] = 0;
  long long ans = 0;
  for (int i = 1; i <= N - 2; ++i) {
    ans += (N - i - 1) * solve(i, K - 1);
    ans %= MOD;
  }
  return dp[N][K] = ans;
}
int N, M, K;
int main() {
  memset(dp, -1, sizeof(dp));
  scanf("%d%d%d", &N, &M, &K);
  printf("%lld\n", solve(N, K) * solve(M, K) % MOD);
}
