#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
long long c[1 << 10][1 << 11];
void init() {
  c[0][0] = 1;
  for (int i = 0; i < (1 << 10); i++) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
  }
}
int main() {
  int n, m, k;
  init();
  while (~scanf("%d%d%d", &n, &m, &k)) {
    printf("%lld\n", c[n - 1][2 * k] * c[m - 1][2 * k] % mod);
  }
  return 0;
}
