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