#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double Pi = 3.1415926535897932;
const int dir[4][2] = {-1, 0, 0, -1, 1, 0, 0, 1};
const int maxn = 1000 + 5;
const int MOD = 1e9 + 7;
long long qpow(long long a, long long p) {
  long long ans = 1;
  while (p) {
    if (p & 1) ans = ans * a % MOD;
    a = a * a % MOD;
    p >>= 1;
  }
  return ans;
}
long long A[maxn];
inline long long inv(long long x) { return qpow(x, MOD - 2); }
long long C(long long n, long long m) {
  if (m > n) return 0;
  return A[n] * inv(A[m]) % MOD * inv(A[n - m]) % MOD;
}
int main() {
  A[0] = 1;
  for (int i = 1; i <= maxn - 3; i++) {
    A[i] = A[i - 1] * i % MOD;
  }
  long long n, m, k;
  cin >> n >> m >> k;
  k <<= 1;
  cout << C(n - 1, k) * C(m - 1, k) % MOD << endl;
  return 0;
}
