#include <bits/stdc++.h>
using namespace std;
long long C[3010][3010];
int main() {
  int n, m, k, a, b;
  cin >> n >> m >> k;
  for (int i = 0; i < 3010; i++) {
    for (int j = i; j < 3010; j++) {
      if (i == 0)
        C[i][j] = 1;
      else
        C[i][j] = (C[i - 1][j - 1] + C[i][j - 1]) % 1000000007ll;
    }
  }
  cout << (C[2 * k][n - 1] * C[2 * k][m - 1]) % 1000000007ll;
  return 0;
}
