#include <bits/stdc++.h>
using namespace std;
static const int INF = 500000000;
template <class T>
void debug(T a, T b) {
  for (; a != b; ++a) cerr << *a << ' ';
  cerr << endl;
}
int n, m, k;
long long int mod = 1000000007;
long long int dp[1005][1005];
long long int C[1005][2005];
int main() {
  for (int i = 0; i < 1005; ++i) {
    C[i][0] = 1;
    for (int j = 0; j < i; ++j)
      C[i][j + 1] = (C[i - 1][j] + C[i - 1][j + 1]) % mod;
  }
  scanf("%d%d%d", &n, &m, &k);
  cout << C[n - 1][k * 2] * C[m - 1][k * 2] % mod << endl;
  return 0;
}
