#include <bits/stdc++.h>
const int mod = 1000000007;
using namespace std;
int c[1010][2010];
int main() {
  ios_base::sync_with_stdio(false);
  int n, m, k, l;
  cin >> n >> m >> k;
  l = max(n, m);
  for (int i = 0; i < l; ++i) {
    c[i][0] = 1;
    for (int j = 1; j <= 2 * k && j <= i; ++j)
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
  }
  long long ANS = (c[n - 1][2 * k] * 1LL * c[m - 1][k * 2]) % mod;
  cout << ANS << endl;
  return 0;
}
