#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long n, m, k, C[1005][1005];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k;
  for (long long i = 0; i <= 1000; ++i) C[0][i] = C[i][i] = 1;
  for (long long i = 1; i <= 1000; ++i) {
    for (long long j = 1; j < i; ++j) {
      C[j][i] = C[j - 1][i - 1] + C[j][i - 1];
      C[j][i] %= mod;
    }
  }
  if (2 * k > n - 1 || 2 * k > m - 1)
    cout << 0;
  else
    cout << (C[2 * k][n - 1] * C[2 * k][m - 1]) % mod;
  return 0;
}
