#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int maxN = 1100;
int D[maxN][maxN];
int sum[maxN][maxN], sum2[maxN][maxN];
int N, M, K;
int main() {
  int i, j, k;
  scanf("%d%d%d", &N, &M, &K);
  for (i = 1000; i >= 1; i--) {
    D[K][i] = 1;
    sum[K][i] = 1000 - i + 1 + sum[K][i + 1];
    sum2[K][i] = sum2[K][i + 1] + 1;
  }
  for (i = K - 1; i >= 0; i--) {
    D[1][i] = 0;
    for (j = 2; j <= 1000; j++) {
      D[i][j] = sum[i + 1][1] - sum[i + 1][j - 1];
      if (D[i][j] < 0) D[i][j] += mod;
      int scad = sum2[i + 1][1] - sum2[i + 1][j - 1];
      if (scad < 0) scad += mod;
      D[i][j] = D[i][j] - (1LL * (1000 - j + 2) * scad) % mod;
      if (D[i][j] < 0) D[i][j] += mod;
    }
    for (j = 1000; j >= 1; j--) {
      sum[i][j] =
          (sum[i][j] + 1LL * (1000 - j + 1) * D[i][j] + sum[i][j + 1]) % mod;
      sum2[i][j] = (sum2[i][j + 1] + D[i][j]) % mod;
    }
  }
  printf("%lld\n", (1LL * D[0][N] * D[0][M]) % mod);
  return 0;
}
