#include <bits/stdc++.h>
using namespace std;
long long int dp[1024][1024];
long long int sums[1024][1024];
int main() {
  int N, M, K;
  cin >> N >> M >> K;
  for (int i = 0; i <= K; i++) dp[0][i] = 0;
  dp[0][0] = 1;
  for (int i = 1; i <= max(N, M); i++) {
    long long int tot = dp[i - 1][0];
    dp[i][0] = 1;
    dp[i][1] = (i * (i + 1)) / 2;
    sums[i][1] = (sums[i - 1][1] + dp[i][1]) % 1000000007;
    for (int j = 2; j <= K; j++) {
      dp[i][j] =
          (dp[i - 1][j] + (i - 2 >= 0 ? sums[i - 2][j - 1] : 0)) % 1000000007;
      sums[i][j] = (sums[i - 1][j] + dp[i][j]) % 1000000007;
    }
  }
  cout << (dp[N - 2][K] * dp[M - 2][K]) % 1000000007 << endl;
  return 0;
}
