#include <bits/stdc++.h>
using namespace std;
const int N = 2048;
const long long P = 1e9 + 7;
long long n, m, k, ans, C[N + 4][N + 4];
int main() {
  scanf("%lld %lld %lld", &n, &m, &k);
  memset(C, 0, sizeof C);
  for (int i = 0; i <= N; ++i) {
    C[i][0] = 1;
    for (int j = 1; j <= i; ++j) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % P;
  }
  ans = (C[n - 1][k + k] * C[m - 1][k + k]) % P;
  printf("%lld\n", ans);
  return 0;
}
