#include <bits/stdc++.h>
using namespace std;
int n, m, k;
long long tmp[1010][2010];
const int mod = 1e9 + 7;
void init() {
  memset(tmp, 0, sizeof(tmp));
  for (int i = 0; i <= 1000; i++) tmp[i][0] = 1;
  for (int i = 1; i <= 1000; i++)
    for (int j = 1; j <= i; j++)
      tmp[i][j] = (tmp[i - 1][j] + tmp[i - 1][j - 1]) % mod;
}
int main() {
  init();
  cin >> n >> m >> k;
  if (n - 2 <= 0 || m - 2 <= 0) {
    cout << 0 << endl;
    return 0;
  }
  cout << (tmp[n - 1][2 * k] * tmp[m - 1][2 * k]) % mod << endl;
  return 0;
}
