#include <bits/stdc++.h>
using namespace std;
const double pi = 3.1415926535;
const double eps = 1e-4;
long dp[1001][1001], i, j, k, l, n, m, p;
long sum[1001][1001];
int main() {
  for (i = 1; i < 1001; ++i) dp[0][i] = 1, sum[0][i] = sum[0][i - 1] + 1;
  for (i = 1; i < 1001; ++i)
    for (j = i * 2 + 1; j < 1001; ++j) {
      if (1000000007 <= (dp[i][j] = dp[i][j - 1] + sum[i - 1][j - 2]))
        dp[i][j] -= 1000000007;
      if (1000000007 <= (sum[i][j] = dp[i][j] + sum[i][j - 1]))
        sum[i][j] -= 1000000007;
    }
  cin >> n >> m >> p;
  cout << (long long)dp[p][n] * dp[p][m] % 1000000007 << endl;
  cin >> n;
  return 0;
}
