#include <bits/stdc++.h>
using namespace std;
long long modulo(long long a, unsigned long long b, int n) {
  long long x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) x = (x * y) % n;
    y = (y * y) % n;
    b /= 2;
  }
  return (x % n);
}
long long inversemod(long long n) {
  return modulo(n, 1000000007 - 2, 1000000007);
}
long long C(long long n, long long r) {
  long long ans = 1;
  if (n <= 0 || r < 0)
    ans = 0;
  else if (r == 0)
    ans = 1;
  else {
    for (int i = r; i >= 1; i--) {
      ans = (ans *
             ((((n - r + i) % 1000000007) * (inversemod(i))) % 1000000007)) %
            1000000007;
    }
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, m, k;
  cin >> n >> m >> k;
  long long ans = (C(n - 1, 2 * k) * C(m - 1, 2 * k)) % 1000000007;
  cout << ans;
}
