#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const int MOD = 1e+9 + 7;
const int LIM = 2e+3;
void Mult(int& a, int b) {
  static long long buf;
  buf = a;
  buf *= b;
  buf %= MOD;
  a = buf;
}
int GetMult(int a, int b) {
  Mult(a, b);
  return a;
}
int GetPow(int x, int p) {
  int res = 1;
  while (p) {
    if (p & 1) {
      Mult(res, x);
      --p;
    } else {
      Mult(x, x);
      p /= 2;
    }
  }
  return res;
}
int GetInv(int x) {
  static vector<int> buf(LIM + 1, -1);
  int& res = buf[x];
  if (res >= 0) {
    return res;
  }
  return res = GetPow(x, MOD - 2);
}
void Div(int& a, int b) { Mult(a, GetInv(b)); }
int main() {
  auto start = high_resolution_clock::now();
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<int>> c(LIM + 1, vector<int>(LIM + 1, 0));
  for (int total = 0; total <= LIM; ++total) {
    c[total][0] = 1;
  }
  for (int total = 0; total <= LIM; ++total) {
    for (int pick = 1; pick <= total; ++pick) {
      c[total][pick] = c[total][pick - 1];
      Mult(c[total][pick], total - pick + 1);
      Div(c[total][pick], pick);
    }
  }
  cout << GetMult(c[n - 1][2 * k], c[m - 1][2 * k]) << endl;
  cerr << "Total execution time : "
       << duration_cast<milliseconds>(high_resolution_clock::now() - start)
              .count()
       << " ms" << endl;
  return 0;
}
