#include <bits/stdc++.h>
using namespace std;
long long f[1010][1010], sum[1010];
const long long L = 1000000007LL;
int n, m, k;
void init() {
  int i, j;
  memset(sum, 0, sizeof(sum));
  memset(f, 0, sizeof(f));
  for (i = 0; i < 1010; ++i) f[i][0] = 1;
  for (i = 3; i < 1010; ++i) {
    for (j = 1; j < 1010; ++j) sum[j] = (sum[j] + f[i - 2][j - 1]) % L;
    for (j = 1; j < 1010; ++j) f[i][j] = (f[i - 1][j] + sum[j]) % L;
  }
}
int main() {
  init();
  while (scanf("%d%d%d", &n, &m, &k) != EOF)
    printf("%lld\n", f[n][k] * f[m][k] % L);
  return 0;
}
