#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007LL;
long long fp[1036][1036];
long long sub[1036];
int main() {
  memset(fp, 0, sizeof(fp));
  for (int j = (1); j <= (int)(1000); j++) fp[0][j] = 1LL;
  for (int i = (1); i <= (int)(1000); i++) {
    long long dia = 0LL;
    long long sum = 0LL;
    for (int j = (1); j <= (int)(1000); j++) {
      (sum += fp[i - 1][j]) %= MOD;
      (dia += sum) %= MOD;
      fp[i][j + 2] = dia;
    }
  }
  int n, m, k;
  while (cin >> n >> m >> k) {
    long long ans2 = (fp[k][n] * fp[k][m]) % MOD;
    cout << ans2 << endl;
  }
  return 0;
}
