#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007, inf = 4e18;
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(nullptr);
  cout << fixed << setprecision(0);
  int64_t n, m, k;
  cin >> n >> m >> k;
  if (n <= 2 || m <= 2) return cout << 0, 0;
  vector<vector<int64_t> > dp(k + 1, vector<int64_t>(max(n, m) + 1, 0));
  dp[0] = vector<int64_t>(max(n, m) + 1, 1);
  for (int64_t i = 1; i <= k; i++) {
    int64_t ps = 0, sum = 0;
    dp[i][1] = dp[i][2] = 0;
    for (int64_t j = 3; j <= max(n, m); j++) {
      sum = (sum + dp[i - 1][j - 2]) % mod;
      ps = (ps + sum) % mod;
      dp[i][j] = ps;
    }
  }
  cout << dp[k][n] * dp[k][m] % mod;
  return 0;
}
