#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000 * 1000 * 1000 + 7;
const int maxn = 2000 + 10;
long long c[maxn][maxn];
long long n, m, k;
int main() {
  ios_base::sync_with_stdio(false);
  for (int i = 0; i < maxn; ++i)
    for (int j = 0; j <= i; ++j)
      if (i == j || j == 0)
        c[i][j] = 1;
      else
        c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
  cin >> n >> m >> k;
  cout << c[n - 1][2 * k] * c[m - 1][2 * k] % mod << endl;
  return 0;
}
