#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
const long long mod = 1000000007;
long long C[maxn][maxn];
int main() {
  memset(C, 0, sizeof(C));
  C[0][0] = 1;
  for (int i = 1; i <= 1000; i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
  }
  int n, m, k;
  while (~scanf("%d%d%d", &n, &m, &k)) {
    long long ans1 = 0, ans2 = 0;
    n -= 1;
    m -= 1;
    k *= 2;
    if (n >= k) {
      ans1 = C[n][k];
    }
    if (m >= k) {
      ans2 = C[m][k];
    }
    printf("%lld\n", ans1 * ans2 % mod);
  }
  return 0;
}
