#include <bits/stdc++.h>
using namespace std;
int n, m, k;
long long c[1010][1010];
const int mod = 1e9 + 7;
void pre() {
  for (int i = 0; i <= 1005; i++) {
    c[i][0] = c[i][i] = 1;
  }
  for (int i = 1; i <= 1005; i++) {
    for (int j = 0; j <= i; j++) {
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
      ;
    }
  }
}
int main(int argc, char const *argv[]) {
  scanf("%d%d%d", &n, &m, &k);
  pre();
  if (2 * k > n - 1 || 2 * k > m - 1) {
    printf("0");
  } else {
    printf("%lld\n", c[n - 1][k * 2] * c[m - 1][k * 2] % mod);
  }
  return 0;
}
