#include <bits/stdc++.h>
using namespace std;
const int maxn = 2005;
const int mod = 1e9 + 7;
int c[maxn][maxn];
void init() {
  c[0][0] = 1;
  for (int i = 1; i <= 2000; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++)
      c[i][j] = 1LL * (c[i - 1][j - 1] + c[i - 1][j]) % mod;
  }
}
int n, m, k;
int main() {
  init();
  scanf("%d %d %d", &n, &m, &k);
  if (n - 1 < 2 * k || m - 1 < 2 * k) {
    puts("0");
    return 0;
  }
  printf("%lld\n", 1LL * c[n - 1][2 * k] * c[m - 1][k * 2] % mod);
  return 0;
}
