#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL;
long long memo[1001][1001];
long long calc(int n, int k) {
  if (k == 0) return 1;
  if (n < 3) return 0;
  if (memo[n][k] != -1) return memo[n][k];
  long long ret = 0;
  for (int w = (1); w < (int)n - 2 + 1; ++w) {
    long long cnt = n - w - 1;
    ret += calc(w, k - 1) * cnt;
  }
  return memo[n][k] = ret % MOD;
}
int main() {
  memset(memo, -1, sizeof(memo));
  int n, m, k;
  while (cin >> n >> m >> k) {
    long long ans = calc(n, k) * calc(m, k) % MOD;
    cout << ans << endl;
  }
  return 0;
}
