#include <bits/stdc++.h>
using namespace std;
const long long N = 2e3 + 100;
const long long mod = 1e9 + 7;
long long c[N][N];
long long choose(long long n, long long k) {
  if (c[n][k] != -1) return c[n][k];
  if (k > n) return 0;
  if (k == n || k == 0) return 1;
  c[n][k] = (choose(n - 1, k - 1) + choose(n - 1, k)) % mod;
  return c[n][k];
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  memset(c, -1, sizeof(c));
  long long n, m, k;
  cin >> n >> m >> k;
  n--;
  m--;
  cout << (choose(n, 2 * k) * choose(m, 2 * k)) % mod << "\n";
  return 0;
}
