#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1E-9;
const int INF = (int)1E9;
const long long INF64 = (long long)1E18;
const long double PI = 2 * acos(.0);
map<pair<int, int>, int> calc;
int const MAXB = 1005;
int const MOD = 1000000007;
long long binCoeff[MAXB][MAXB];
void binCoeffients(int n) {
  for (int i = 0; i <= n; i++) binCoeff[i][i] = binCoeff[i][0] = 1;
  for (int i = 2; i <= n; i++)
    for (int j = 1; j < n; j++)
      binCoeff[i][j] = (binCoeff[i - 1][j - 1] + binCoeff[i - 1][j]) % MOD;
}
int main() {
  int m, n, k;
  cin >> m >> n >> k;
  binCoeffients(1003);
  long long solm = 0, soln = 0;
  if (m >= 2 * k) solm += binCoeff[m - 2][2 * k];
  if (m >= 2 * k - 1) solm = (solm + binCoeff[m - 2][2 * k - 1]) % MOD;
  if (n >= 2 * k) soln += binCoeff[n - 2][2 * k];
  if (n >= 2 * k - 1) soln = (soln + binCoeff[n - 2][2 * k - 1]) % MOD;
  long long sol = (solm * soln) % MOD;
  cout << sol << endl;
  return 0;
}
