#include <bits/stdc++.h>
using namespace std;
const long long base = 1e9 + 7;
long long n, m, k, dp[1069][2069];
int main() {
  scanf("%lld%lld%lld", &n, &m, &k);
  for (int i = 1; i <= 2005; i++)
    for (int j = i; j <= 1005; j++) {
      if (i == j || i == 1)
        dp[j][i] = 1;
      else
        dp[j][i] = (dp[j - 1][i - 1] + dp[j - 1][i]) % base;
    }
  cout << ((dp[m][2 * k + 1] % base) * (dp[n][2 * k + 1] % base)) % base;
}
