#include <bits/stdc++.h>
using namespace std;
long long x, y, g, fac[10010], mod = 1000000007, n, m, k;
long long xgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long x1, y1, gcd = xgcd(b, a % b, x1, y1);
  x = y1;
  y = x1 - (long long)(a / b) * y1;
  return gcd;
}
long long entekhab(long long r, long long n) {
  if (r > n) return 0;
  if (r == 0) return 1;
  long long ans = 1;
  ans = fac[n];
  x = 1, y = 1, g = xgcd(fac[r], mod, x, y);
  ans = (ans * ((x + mod) % mod)) % mod;
  x = 1, y = 1, g = xgcd(fac[n - r], mod, x, y);
  ans = ((ans * ((x + mod) % mod))) % mod;
  return ans;
}
int main() {
  fac[0] = 1;
  for (long long i = 1; i < 10005; i++) fac[i] = (fac[i - 1] * i) % mod;
  cin >> n >> m >> k;
  k *= 2;
  cout << (entekhab(k, n - 1) * entekhab(k, m - 1)) % mod;
}
