#include <bits/stdc++.h>
using namespace std;
const long long MOD = int(1e9) + 7;
int c[1009][1009];
long long C(int n, int m) {
  if (m > n) return 0;
  return c[n][m];
}
int main() {
  c[0][0] = 1;
  for (int i = 1; i < 1009; ++i) {
    c[i][0] = 1;
    for (int j = 1; j <= i; ++j)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % MOD;
  }
  int n, m, k;
  cin >> n >> m >> k;
  long long res = C(n - 1, k * 2) * C(m - 1, k * 2) % MOD;
  cout << res << endl;
  return 0;
}
