#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000;
const long long mod = (long long)(1e9 + 7);
long long dp[1005][1005];
long long second[1005][1005], t[1005][1005];
int main() {
  for (int i = 2; i <= maxn + 3; ++i) {
    dp[i][0] = 1;
    for (int j = 1; j <= maxn + 3; ++j) dp[i][j] = second[i - 2][j - 1];
    for (int j = 0; j <= maxn + 3; ++j)
      t[i][j] = (dp[i][j] + t[i - 1][j]) % mod;
    for (int j = 0; j <= maxn + 3; ++j)
      second[i][j] = (second[i - 1][j] + t[i - 1][j] + dp[i][j]) % mod;
  }
  int n, m, k;
  cin >> n >> m >> k;
  long long res = (dp[n + 1][k] * dp[m + 1][k]) % mod;
  cout << res << endl;
  return 0;
}
