#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-5;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
int n, m, k;
long long c[1005][1005];
long long solve(void) {
  if (2 * k > n - 1 || 2 * k > m - 1) return 0;
  return (c[n - 1][2 * k] * c[m - 1][2 * k]) % mod;
}
int main(void) {
  ios_base::sync_with_stdio(0);
  for (int i = 0; i < 1000; i++) {
    c[i][0] = 1, c[i][i] = 1;
    for (int j = 1; j <= i - 1; j++)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
  }
  while (cin >> n >> m >> k) cout << solve() << '\n';
  return 0;
}
