#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
const int B = 1e9 + 7;
int n, m, k;
long long c[N][N];
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i < N; ++i) {
    c[i][0] = 1;
  }
  for (int i = 1; i < N; ++i) {
    for (int j = 1; j <= i; ++j) {
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % B;
    }
  }
  if (2 * k > n - 1 || 2 * k > m - 1) {
    puts("0");
    return 0;
  }
  printf("%I64d\n", c[n - 1][2 * k] * c[m - 1][2 * k] % B);
  return 0;
}
