#include <bits/stdc++.h>
using namespace std;
double const eps = 1e-6;
const int inf = 0x3fffffff;
const int mod = 1000000007;
const int size = 1000 + 5;
int dp[size][size];
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  memset(dp, 0, sizeof(dp));
  int M = max(n, m);
  for (int i = 1; i <= M; i++) dp[0][i] = 1;
  for (int i = 1; i <= k; i++) {
    long long sum = 0;
    for (int j = 2; j <= M; j++) {
      sum = (sum + dp[i - 1][j - 2]) % mod;
      dp[i][j] = (sum + dp[i][j - 1]) % mod;
    }
  }
  int ans;
  ans = (1LL * dp[k][n] * dp[k][m]) % mod;
  cout << ans << endl;
  return 0;
}
