#include <bits/stdc++.h>
using namespace std;
int pascal[2000][2000];
int binom(int n, int k) {
  if (k == 0) return 1;
  if (k > n) return 0;
  return pascal[n][k];
}
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 0; i <= 1000; i++) {
    pascal[i][0] = 1;
    pascal[i][i] = 1;
  }
  for (int i = 0; i <= 1000; i++)
    for (int j = 0; j < i; j++) {
      pascal[i][j] = (pascal[i - 1][j - 1] + pascal[i - 1][j]) % 1000000007;
    }
  int value =
      ((long long)binom(n - 1, 2 * k) * binom(m - 1, 2 * k)) % 1000000007;
  printf("%d\n", value);
  return 0;
}
