#include <bits/stdc++.h>
using namespace std;
long long n, m, K, C[2005][2005];
signed main() {
  scanf("%lld%lld%lld", &n, &m, &K);
  C[0][0] = 1;
  for (long long i = 1; i < 2005; i++) {
    C[i][0] = 1;
    for (long long j = 1; j <= i; j++)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % 1000000007;
  }
  long long ans = C[n - 1][2 * K] * C[m - 1][2 * K] % 1000000007;
  printf("%lld\n", ans);
  return 0;
}
