#include <bits/stdc++.h>
const int MOD = 1000000007;
int C[1003][2003];
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 0; i < 1000; i++)
    for (int j = 0; j <= i; j++) {
      if (j == 0 || j == i)
        C[i][j] = 1;
      else
        C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
    }
  printf("%lld\n", (long long)C[n - 1][2 * k] * (long long)C[m - 1][2 * k] %
                       (long long)MOD);
  return 0;
}
