#include <bits/stdc++.h>
using namespace std;
const int MAX = 1001;
const int mod = 1000000007;
int memo[MAX][MAX];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 1; i < MAX; i++) memo[0][i] = 1;
  for (int i = 0; i < (int)(MAX - 1); i++) {
    for (int j = i * 2 + 1; j < MAX; j++) {
      if (memo[i][j]) {
        for (int k = j + 2; k < MAX; k++) {
          memo[i + 1][k] =
              (memo[i + 1][k] + (long long)(k - j - 1) * memo[i][j]) % mod;
        }
      } else {
        break;
      }
    }
  }
  long long ansN = memo[k][n];
  long long ansM = memo[k][m];
  cout << (ansN * ansM) % mod << endl;
  return 0;
}
