#include <bits/stdc++.h>
using namespace std;
long long pd[1024][1024];
long long solve(int v, int k) {
  if (pd[v][k] != -1) return pd[v][k];
  if (k == 0) return 1;
  long long ans = 0;
  for (int i = 1; i <= v - 2; i++) ans += (v - i - 1) * solve(i, k - 1);
  ans %= 1000000007;
  return pd[v][k] = ans;
}
int main() {
  int n, m, k;
  memset(pd, -1, sizeof(pd));
  scanf("%d %d %d", &n, &m, &k);
  cout << ((solve(n, k) * solve(m, k)) % 1000000007) << endl;
  return 0;
}
