#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, M = 1001;
int n, m, k, w1, w2, ans;
int dp[M][M], sum[M][M];
void gx(int ma) {
  dp[0][ma] = 1;
  for (int i = 1; i <= ma; i++) sum[0][i] = 1;
  for (int i = 1; i <= k; i++) {
    int t = 0;
    for (int j = ma - 2; j >= 1; j--) {
      t = (t + sum[i - 1][j + 2]) % P;
      dp[i][j] = (dp[i][j] + t) % P;
      sum[i][j] = (sum[i][j + 1] + dp[i][j]) % P;
    }
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &k);
  gx(n);
  for (int i = 1; i <= n; i++) w1 = (w1 + dp[k][i]) % P;
  memset(dp, 0, sizeof(dp));
  memset(sum, 0, sizeof(sum));
  gx(m);
  for (int i = 1; i <= m; i++) w2 = (w2 + dp[k][i]) % P;
  ans = w1 * 1ll * w2 % P;
  printf("%d\n", ans);
}
