#include <bits/stdc++.h>
using namespace std;
const long long M = 2005, YD = 1e9 + 7;
int n, m, K, C[M][M];
void init(int n) {
  for (int i = 0; i <= n; i++) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % YD;
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &K);
  if (n < m) swap(n, m);
  init(n);
  cout << C[n - 1][2 * K] * (long long)C[m - 1][2 * K] % YD << endl;
  return 0;
}
