#include <bits/stdc++.h>
int diru[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dirv[] = {-1, 0, 1, -1, 1, -1, 0, 1};
using namespace std;
template <class T>
T sq(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
bool inside(T a, T b, T c) {
  return a <= b && b <= c;
}
template <class T>
void setmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void setmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
T power(T N, T P) {
  return (P == 0) ? 1 : N * power(N, P - 1);
}
bool isV[1010][1010];
int dp[1010][1010];
int M = 1000000007;
int cal(int n, int r) {
  if (n < r) return 0;
  if (r > n - r) r = n - r;
  if (r == 0) return 1;
  if (isV[n][r]) return dp[n][r];
  isV[n][r] = 1;
  return dp[n][r] = (cal(n - 1, r) + cal(n - 1, r - 1)) % M;
}
int main() {
  int n, T, t = 1, m, i, j, k;
  while (scanf("%d", &n) == 1) {
    scanf("%d", &m);
    scanf("%d", &k);
    int ans = (((long long unsigned)cal(n - 1, 2 * k) *
                (long long unsigned)cal(m - 1, 2 * k)) %
               (long long unsigned)M);
    printf("%d\n", ans);
  }
  return 0;
}
