#include <bits/stdc++.h>
using namespace std;
const double pi = 3.141592653589793238463;
const int m = 1000000007;
long long c[1009][1009];
long long choose(int n, int k) {
  if (n < k) return 0;
  if (n == k || k == 0) return 1;
  if (k == 1) return n;
  if (c[n][k] != -1) return c[n][k];
  return c[n][k] = (choose(n - 1, k) + choose(n - 1, k - 1)) % m;
}
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  memset((c), (-1), sizeof(c));
  int a, b, k;
  cin >> a >> b >> k;
  cout << (choose(a - 1, 2 * k) * choose(b - 1, 2 * k)) % m << '\n';
  return 0;
}
