#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const int M = 1000000007;
int n, m, k;
int dp[1001][1001];
void solution() {
  cin >> n >> m >> k;
  int sz = 2 * k + 1;
  if (min(n, m) < sz) {
    puts("0");
    return;
  }
  for (int i = 0, _n = (1001); i < _n; ++i)
    for (int j = 0, _n = (1001); j < _n; ++j)
      if (i == 0)
        dp[i][j] = j == 0;
      else if (j == 0)
        dp[i][j] = 1;
      else
        dp[i][j] = (dp[i][j - 1] + dp[i - 1][j]) % M;
  int ret = (dp[sz][n - sz] * 1LL * dp[sz][m - sz]) % M;
  printf("%d\n", ret);
}
int main() {
  solution();
  return 0;
}
