#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
long long a[maxn][maxn], b[maxn][maxn];
const long mod = 1e9 + 7;
int C(int r, int n) {
  if (r > n || r < 0)
    return 0;
  else {
    if (r == 0 || r == n)
      return 1;
    else {
      if (a[r][n] == 0)
        return a[r][n] = (C(r, n - 1) + C(r - 1, n - 1)) % mod;
      else
        return a[r][n];
    }
  }
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  cout << (1LL * C(2 * k, n - 1) * C(2 * k, m - 1)) % mod;
}
