#include <bits/stdc++.h>
using namespace std;
const int mx = 2002;
long long mod = 1000 * 1000 * 1000 + 7;
long long c[mx][mx];
int main() {
  long long n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i <= 1000; i++) {
    c[i][i] = 1;
    c[0][i] = 1;
  }
  for (int i = 1; i <= 1000; i++) {
    for (int j = i; j <= 1000; j++) {
      c[i][j] = (c[i - 1][j - 1] + c[i][j - 1]) % mod;
    }
  }
  long long ans = (c[2 * k][m - 1] * c[2 * k][n - 1]) % mod;
  cout << ans;
}
