#include <bits/stdc++.h>
using namespace std;
const double pi = 3.1415926535897932384626433832795;
const int inf = 1e9;
const long long inf2 = 1e18;
const int mod = 1e9 + 7;
void boost() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
const int N = 2e3 + 3;
int ncr[N][N];
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < N; ++i)
    for (int j = 0; j < i + 1; ++j)
      if (j == 0 || i == j)
        ncr[i][j] = 1;
      else
        ncr[i][j] = (ncr[i - 1][j - 1] + ncr[i - 1][j]) % mod;
  long long ans = (ncr[n - 1][2 * k] * 1LL * ncr[m - 1][2 * k]) % mod;
  cout << ans;
  return;
}
int main() {
  boost();
  int tc = 1;
  while (tc--) solve();
  return 0;
}
