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