#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long dp[1100][1100] = {};
long long sum[1100][1100] = {};
long long n, m, k;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= max(n, m); i++)
    dp[i][0] = 1, sum[i][0] = sum[i - 1][0] + dp[i][0];
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= max(n, m); j++) {
      dp[j][i] = dp[j - 1][i];
      if (j - 2 >= 0) dp[j][i] += sum[j - 2][i - 1];
      dp[j][i] %= mod;
      sum[j][i] = sum[j - 1][i] + dp[j][i];
      sum[j][i] %= mod;
    }
  }
  long long ans = dp[n][k] * dp[m][k];
  ans %= mod;
  cout << ans << endl;
  return 0;
}
