#include <bits/stdc++.h>
using namespace std;
const int N = 1005, MOD = 1e9 + 7;
long long comb[N][N];
long long f(long long n, long long k) {
  vector<long long> dp(n + 1), nxt(n + 1);
  dp[0] = 1;
  for (int t = 0; t < k; ++t) {
    for (int i = 0; i <= n; ++i)
      for (int j = 0; j <= i; ++j) nxt[i] += dp[i - j] * (j + 1);
    for (int i = 0; i <= n; ++i) nxt[i] %= MOD;
    swap(dp, nxt);
    nxt = vector<long long>(n + 1);
  }
  long long ans = 0;
  for (int i = 0; i <= n; ++i) ans = (ans + dp[i]) % MOD;
  return ans;
}
int main() {
  comb[0][0] = 1;
  for (int i = 1; i < N; ++i)
    for (int j = 0; j < N; ++j) {
      comb[i][j] = comb[i - 1][j];
      if (j) comb[i][j] = (comb[i - 1][j - 1] + comb[i][j]) % MOD;
    }
  int n, m, k;
  cin >> n >> m >> k;
  if (k * 2 + 1 > min(n, m)) {
    puts("0");
    exit(0);
  }
  n -= 2 * k + 1;
  m -= 2 * k + 1;
  long long dp[N] = {};
  long long ans[2] = {};
  ans[0] = f(n, k);
  ans[1] = f(m, k);
  cout << ans[0] * ans[1] % MOD << '\n';
}
