#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long qpow(long long p, long long q) {
  return (q & 1 ? p : 1) * (q ? qpow(p * p % mod, q / 2) : 1) % mod;
}
long long inv(long long p) { return qpow(p, mod - 2); }
long long fac(long long p) {
  if (p == 0) return 1;
  return p * fac(p - 1) % mod;
}
long long ncr(long long n, long long r) {
  if (r < 0 || r > n) return 0;
  return fac(n) * inv(fac(r)) % mod * inv(fac(n - r)) % mod;
}
signed main() {
  ios::sync_with_stdio(false);
  long long n, m, k;
  cin >> n >> m >> k;
  cout << ncr(n - 1, k * 2) * ncr(m - 1, k * 2) % mod << endl;
}
