#include <bits/stdc++.h>
using namespace std;
const int N = 1111;
int n, m, k;
long long dp[N][N], sum[N][N], MOD = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cerr.tie(NULL);
  cin >> n >> m >> k;
  for (int i = 1; i < N; i++) {
    dp[i][1] = 1;
    sum[i][1] = sum[i - 1][1] + 1;
  }
  for (int i = 2; i <= k + 1; i++) {
    for (int j = 2; j < N; j++) {
      dp[j][i] = (dp[j - 1][i] + sum[j - 2][i - 1]) % MOD;
      sum[j][i] = (sum[j - 1][i] + dp[j][i]) % MOD;
    }
  }
  cout << (dp[n][k + 1] * dp[m][k + 1]) % MOD << endl;
  return 0;
}
