#include <bits/stdc++.h>
using namespace std;
const int N = 1002, mod = 1e9 + 7;
int c[N][N];
void add(int &a, int b) {
  a += b;
  for (; a >= mod; a -= mod)
    ;
  for (; a < 0; a += mod)
    ;
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  c[0][0] = 1;
  if (2 * k > min(n - 1, m - 1)) {
    cout << 0;
    return 0;
  }
  for (int i = 1; i < N; ++i) {
    c[i][0] = 1;
    for (int j = 1; j <= i; ++j) {
      c[i][j] = c[i - 1][j];
      add(c[i][j], c[i - 1][j - 1]);
    }
  }
  cout << (1LL * c[n - 1][2 * k] * c[m - 1][2 * k]) % mod;
}
