#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  int binom[1010][1010] = {0};
  binom[0][0] = 1;
  for (int i = 1; i < max(n, m); i++) {
    binom[i][0] = 1;
    for (int j = 1; j <= i + 1; j++) {
      binom[i][j] = (binom[i - 1][j - 1] + binom[i - 1][j]) % 1000000007;
    }
  }
  cout << ((long long)binom[m - 1][2 * k] * binom[n - 1][2 * k]) % 1000000007
       << endl;
}
