#include <bits/stdc++.h>
using namespace std;
const int p = 1000000007;
int n, m, k;
int dp[1005][1005];
int main() {
  cin >> n >> m >> k;
  for (int i = 0; i < 1005; i++) dp[0][i] = 1;
  for (int i = 1; i < 1005; i++) {
    int sum = 0;
    int sum2 = 0;
    for (int j = 2; j < 1005; j++) {
      sum = (sum + dp[i - 1][j - 2]) % p;
      sum2 = (sum2 + sum) % p;
      dp[i][j] = sum2;
    }
  }
  cout << (long long)dp[k][n - 1] * dp[k][m - 1] % p;
  return 0;
}
