#include <bits/stdc++.h>
using namespace std;
long long int DN[1001][1001], sum, sum2;
int A, B, K, N;
int main() {
  scanf("%d %d %d", &A, &B, &K);
  N = max(A, B);
  for (int i = 1; i <= N; i++) DN[0][i] = 1;
  for (int i = 0; i < K; i++) {
    sum = sum2 = 0;
    for (int j = 2; j <= N; j++) {
      sum2 += DN[i][j - 2];
      sum2 %= 1000000007;
      sum += sum2;
      sum %= 1000000007;
      DN[i + 1][j] = sum;
    }
  }
  printf("%lld\n", (DN[K][A] * DN[K][B]) % 1000000007);
  return 0;
}
