#include <bits/stdc++.h>
using namespace std;
long long c[1005][1005];
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  if (2 * k > min(n, m) - 1)
    printf("0\n");
  else {
    memset(c, 0, sizeof(c));
    c[0][0] = 1;
    for (int i = 1; i < max(n, m); i++) {
      c[i][0] = 1;
      c[i][i] = 1;
      for (int j = 1; j < i; j++) {
        c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % 1000000007;
      }
    }
    printf("%lld\n", c[n - 1][2 * k] * c[m - 1][2 * k] % 1000000007);
  }
  return 0;
}
