#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
long long EXP(long long b, long long p) {
  b %= mod;
  if (p == 0)
    return 1;
  else if (p == 1)
    return b % mod;
  return (EXP((b * b) % mod, p / 2) * EXP(b, p % 2)) % mod;
}
long long C(long long n, long long r) {
  if (r > n) return 0;
  long long ans = 1;
  r = min(r, n - r);
  for (int i = 0; i < r; i++)
    ans = ((ans * (n - i)) % mod * EXP(i + 1, mod - 2)) % mod;
  return ans;
}
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  n--;
  m--;
  k <<= 1;
  cout << (C(n, k) * C(m, k)) % mod << "\n";
}
