#include <bits/stdc++.h>
using namespace std;
int md = 1000000007;
int n, m, k, c[1005][1005], dp[1005][1005];
int main() {
  for (int i = 1; i <= 1000; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % md;
    }
  }
  cin >> n >> m >> k;
  for (int i = 1; i <= 1000; i++) {
    dp[0][i] = 1;
  }
  for (int i = 1; i <= k; i++) {
    bool fv = false;
    for (int j = 1; j <= 1000; j++) {
      if (j + (k - i - 1) * 2 > max(n, m)) break;
      for (int k = 1; k <= j - 2; k++) {
        dp[i][j] =
            ((long long)dp[i][j] + (long long)dp[i - 1][k] * (j - k - 1) % md) %
            md;
      }
      if (dp[i][j] != 0) fv = true;
    }
    if (!fv) break;
  }
  cout << (long long)dp[k][n] * dp[k][m] % md;
  return 0;
}
