#include <bits/stdc++.h>
using namespace std;
long long n, m, k, C[2020][2020], P = 1e9 + 7;
int main() {
  cin >> n >> m >> k;
  C[0][0] = 1;
  for (long long i = 1; i <= 1000; i++) {
    C[i][0] = 1;
    for (long long j = 1; j <= i; j++)
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % P;
  }
  cout << C[n - 1][2 * k] * C[m - 1][2 * k] % P;
  return 0;
}
