#include <bits/stdc++.h>
int f[1010][1010];
int n, m, K;
int max(int x, int y) { return x > y ? x : y; }
int main() {
  scanf("%d%d%d", &n, &m, &K);
  int N = max(n, m);
  for (int i = 1; i <= N; i++) f[i][0] = 1;
  for (int k = 1; k <= K; k++) {
    int sum = 0;
    for (int i = 1; i <= N; i++) {
      if (i - 2 >= 0) sum = (sum + f[i - 2][k - 1]) % 1000000007;
      f[i][k] = (f[i - 1][k] + sum) % 1000000007;
    }
  }
  long long ans = f[n][K];
  ans *= f[m][K];
  ans %= 1000000007;
  printf("%d\n", ans);
  return 0;
}
