#include <bits/stdc++.h>
using namespace std;
int C[1001][1001];
int MOD = (int)1e9 + 7;
int COMBO(int n, int r) {
  if (n < 0 || r < 0) return 0;
  if (n < r) return 0;
  if (C[n][r] != -1) return C[n][r];
  return C[n][r] = (COMBO(n - 1, r - 1) + COMBO(n - 1, r)) % MOD;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  scanf("%d", &n);
  int m;
  scanf("%d", &m);
  int k;
  scanf("%d", &k);
  n--;
  m--;
  if (2 * k > n || 2 * k > m) {
    cout << 0 << endl;
  } else {
    memset(C, -1, sizeof(C));
    C[0][0] = 1;
    cout << 1ULL * COMBO(n, 2 * k) * COMBO(m, 2 * k) % MOD << endl;
  }
  return 0;
}
