#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
const long long inf = 1e15;
const int mod = 1e9 + 7;
long long fact[N], inv[N];
long long powmod(long long base, long long power) {
  long long res = 1;
  while (power) {
    if (power & 1) res = res * base % mod;
    base = base * base % mod;
    power >>= 1;
  }
  return res;
}
long long ncr(long long n, long long r) {
  if (r > n) return 0;
  return fact[n] * inv[r] % mod * inv[n - r] % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, m, k;
  cin >> n >> m >> k;
  fact[0] = fact[1] = inv[0] = inv[1] = 1;
  for (int i = 2; i < N; i++) {
    fact[i] = i * fact[i - 1] % mod;
    inv[i] = powmod(fact[i], mod - 2);
  }
  cout << ncr(n - 1, 2 * k) * ncr(m - 1, 2 * k) % mod << endl;
  return 0;
}
