#include <bits/stdc++.h>
using namespace std;
long long ans;
long long c[1001][1001];
void init() {
  c[0][0] = 1;
  for (int i = 0; i <= 1000; i++) {
    c[i][i] = c[i][0] = 1;
    for (int j = 1; j < i; j++) {
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % 1000000007;
    }
  }
}
int main() {
  long long m, n, k;
  init();
  while (cin >> m >> n >> k) {
    if (m <= 2 * k || n <= 2 * k)
      cout << '0' << endl;
    else {
      ans = (c[m - 1][2 * k] % 1000000007) * (c[n - 1][2 * k] % 1000000007) %
            1000000007;
      cout << ans << endl;
    }
  }
}
