#include <bits/stdc++.h>
using namespace std;
const long long N = 2e3 + 5;
const long long base = 1e9 + 7;
long long m, n, k, c[N][N];
int main() {
  scanf("%lld%lld%lld", &n, &m, &k);
  for (long long i = 1; i <= 2000; i++)
    for (long long j = 1; j <= i; j++) {
      c[0][0] = 1, c[0][i] = 1;
      c[j][i] = (c[j][i - 1] + c[j - 1][i - 1]) % base;
    }
  cout << ((c[2 * k][n - 1] % base) * (c[2 * k][m - 1] % base)) % base;
}
