#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = inf + 7;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int maxn = (int)1e5 + 11;
int n, m, k, dp[2000][2000];
int C(int n, int k) {
  if (n < 0 || k < 0 || k > n) return 0;
  return dp[n][k];
}
int main() {
  n = 2000;
  for (int i = 0; i < n; i++) {
    dp[i][0] = dp[i][i] = 1;
    for (int j = 1; j < i; j++) {
      dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % mod;
    }
  }
  cin >> n >> m >> k;
  int ans = C(n - 1, 2 * k);
  ans = 1ll * ans * C(m - 1, 2 * k) % mod;
  printf("%d\n", ans);
  return 0;
}
