#include <bits/stdc++.h>
using namespace std;
int N, M, K, X;
int res[1010][1010];
int main() {
  cin >> N >> M >> K;
  X = max(N, M);
  for (int i = 1; i < X; i++) res[0][i] = 1;
  for (int i = 0; i < K; i++) {
    int sum = 0, tmp = 0;
    for (int j = 3; j <= X; j++) {
      tmp = (tmp + res[i][j - 2]) % 1000000007;
      sum = (sum + tmp) % 1000000007;
      res[i + 1][j] = sum;
    }
  }
  cout << (long long)res[K][N] * (long long)res[K][M] % 1000000007 << endl;
  return 0;
}
