#include <bits/stdc++.h>
using namespace std;
const int M = 1000 + 10;
long long int mod = (1e+9) + 7;
long long int dp[M][M];
int main() {
  long long int n, m, k;
  cin >> n >> m >> k;
  dp[0][0] = 1;
  for (int i = 1; i < M; i++) {
    for (int j = 1; j <= i; j++) {
      long long int dp1 = dp[i - 1][j];
      long long int dp2 = dp[i - 1][j - 1];
      dp[i][j] = (dp1 + dp2) % mod;
    }
    dp[i][0] = 1;
  }
  if (2 * k > n - 1 || 2 * k > m - 1) {
    cout << "0" << endl;
  } else {
    long long int ans = dp[n - 1][2 * k] % mod;
    ans = (ans * dp[m - 1][2 * k]) % mod;
    cout << ans << endl;
  }
  return 0;
}
