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