#include <bits/stdc++.h>
using namespace std;
long long C[1200][1200];
int main() {
  for (int i = 0; i < 1200; i++) C[i][i] = C[i][0] = 1LL;
  for (int i = 2; i < 1200; i++)
    for (int j = 1; j < i; j++)
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % 1000000007;
  long long k, n, m;
  scanf("%I64d%I64d%I64d", &n, &m, &k);
  if (n - 1 < 2 * k || m - 1 < 2 * k)
    printf("0\n");
  else
    printf("%I64d\n", C[n - 1][2 * k] * C[m - 1][2 * k] % 1000000007);
  return 0;
}
