#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000 * 1000 * 1000 + 7;
long long c[1010][1010];
int main() {
  for (int i = 0; i <= 1000; i++) c[i][0] = 1;
  for (int i = 1; i <= 1000; i++)
    for (int j = 1; j <= i; j++)
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % MOD;
  int n, m, k;
  cin >> n >> m >> k;
  if (2 * k > m || 2 * k > n)
    cout << 0 << endl;
  else
    cout << (c[m - 1][2 * k] * c[n - 1][2 * k]) % MOD << endl;
  cin >> m;
}
