#include <bits/stdc++.h>
using namespace std;
int n, m, k;
long long f;
long long s;
long long ways[1000][2000];
int main() {
  cin >> n >> m >> k;
  ways[0][0] = 1;
  for (int i = 1; i < 1000; i++) {
    ways[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      ways[i][j] = ways[i - 1][j - 1] + ways[i - 1][j];
      ways[i][j] %= 1000000007;
    }
  }
  if (2 * k > n - 1 || 2 * k > m - 1) {
    cout << 0 << endl;
    return 0;
  }
  cout << (ways[n - 1][2 * k] * ways[m - 1][2 * k] % 1000000007) << endl;
  return 0;
}
