#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int memo[1001][1001];
int solve(int n, int k) {
  if (k > n) return 0;
  if (n == k || k == 0) return 1;
  int &res = memo[n][k];
  if (~res) return res;
  res = 0;
  res = solve(n - 1, k);
  res = (res + solve(n - 1, k - 1)) % mod;
  return res;
}
int main() {
  memset(memo, -1, sizeof memo);
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  long long ans = 1ll * solve(n - 1, 2 * k) * solve(m - 1, k * 2);
  printf("%lld", ans % mod);
}
