#include <bits/stdc++.h>
using namespace std;
long long dp[1005][1005];
long long xx[1005][1005];
long long yy[1005][1005];
int main() {
  memset((dp), 0, sizeof(dp));
  memset((xx), 0, sizeof(xx));
  memset((yy), 0, sizeof(yy));
  int m, n, r;
  scanf("%d%d%d", &m, &n, &r);
  int top = max(m, n);
  if (r * 2 >= top) {
    printf("0\n");
    return 0;
  }
  for (int i = (0); i < (int)(top + 1); i++) {
    dp[i][0] = 1;
    if (i > 0) {
      xx[i][0] = xx[i - 1][0] + yy[i - 1][0] + dp[i][0];
      yy[i][0] = yy[i - 1][0] + 1;
    }
    for (int j = (1); j < (int)(r + 1); j++) {
      if (i > 2) {
        dp[i][j] += xx[i - 2][j - 1];
        dp[i][j] %= 1000000007;
      }
      if (i > 0) {
        xx[i][j] = xx[i - 1][j] + yy[i - 1][j] + dp[i][j];
        xx[i][j] %= 1000000007;
        yy[i][j] = yy[i - 1][j] + dp[i][j];
      }
    }
  }
  long long res = (long long)dp[m][r] * (long long)dp[n][r];
  res %= 1000000007;
  cout << res << endl;
  return 0;
}
