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