#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
clock_t clk = clock();
long long int i, j;
void solve(void);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int t = 1;
  while (t--) solve();
  return 0;
}
long long int dp[1001][1001];
long long int ncr(long long int n, long long int r) {
  if (n < 0 || r < 0 || n < r) return 0;
  if (n == r || r == 0) return 1;
  if (dp[n][r] != 0) return dp[n][r];
  return dp[n][r] = (ncr(n - 1, r - 1) + ncr(n - 1, r)) % 1000000007;
}
void solve() {
  long long int n, m, k;
  cin >> n >> m >> k;
  cout << (ncr(n - 1, 2 * k) * ncr(m - 1, 2 * k)) % 1000000007 << "\n";
}
