#include <bits/stdc++.h>
const long long INF = (long long)1e18 + 123;
const int inf = (int)2e9 + 123;
const int mod = 1e9 + 7;
using namespace std;
long long d[2011][2011];
int n, m, k;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> k;
  for (int i = 1; i <= 2000; i++) {
    d[i][0] = d[i][i] = 1;
    for (int j = 1; j < i; j++) {
      d[i][j] = (d[i - 1][j] + d[i - 1][j - 1]) % mod;
    }
  }
  cout << (d[n - 1][2 * k] * d[m - 1][2 * k]) % mod;
  return 0;
}
