#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const double EPS = 1e-9;
const double PI = acos(-1.);
const long long LL_INF = 1e17 + 16;
const int INF = 1e9 + 10;
const long long MOD = 1e9 + 7;
const int MAXN = 2e3 + 5;
long long c[MAXN][MAXN];
long long get_c(int i, int j) {
  if (j < 0 || j > i) {
    return 0;
  }
  return c[i][j];
}
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = (0); i < (int)(MAXN); i++) {
    c[i][0] = 1;
    for (int j = (1); j <= (int)(i); j++) {
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % MOD;
    }
  }
  long long ans = (get_c(n - 1, 2 * k) * get_c(m - 1, 2 * k)) % MOD;
  cout << ans << endl;
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
}
