#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
int n, m, k;
int f[1000 + 10][1000 + 10], g[1000 + 10][1000 + 10];
int main() {
  int i, j;
  scanf("%d%d%d", &n, &m, &k);
  for (j = 1; j <= n || j <= m; ++j) g[0][j] = j;
  for (i = 1; i <= k; ++i)
    for (j = 1; j <= n || j <= m; ++j) {
      f[i][j] = f[i][j - 1];
      if (j >= 2) f[i][j] = (f[i][j] + g[i - 1][j - 2]) % 1000000007;
      g[i][j] = (g[i][j - 1] + f[i][j]) % 1000000007;
    }
  printf("%d\n", (long long)f[k][n] * f[k][m] % 1000000007);
  return 0;
}
