#include <bits/stdc++.h>
using namespace std;
long long int dp[1010][2010];
int main() {
  long long int n, m, k, i, j;
  for (i = 1; i <= 1000; i++) dp[i][0] = 1;
  dp[0][0] = 1;
  for (i = 1; i <= 1000; i++) {
    for (j = 1; j <= 2000; j++) {
      if (j > i) dp[i][j] = 0;
      dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % 1000000007;
    }
  }
  cin >> n >> m >> k;
  cout << (dp[n - 1][2 * k] * dp[m - 1][2 * k]) % 1000000007 << endl;
  return 0;
}
