#include <bits/stdc++.h>
using namespace std;
template <class T>
T _abs(T n) {
  return (n < 0 ? -n : n);
}
template <class T>
T _max(T a, T b) {
  return (!(a < b) ? a : b);
}
template <class T>
T _min(T a, T b) {
  return (a < b ? a : b);
}
template <class T>
T sq(T x) {
  return x * x;
}
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;
}
const double EPS = 1e-9;
const int INF = 0x7f7f7f7f;
const int MAXN = 2000;
const int mod = 1e9 + 7;
long long c[MAXN + 5][MAXN + 5];
void init() {
  c[0][0] = 1;
  for (int(i) = (1); (i) <= (MAXN); ++(i)) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; j++) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
  }
}
int main() {
  init();
  int n, m, k;
  while (cin >> n >> m >> k) {
    cout << c[n - 1][2 * k] * c[m - 1][2 * k] % mod << endl;
  }
  return 0;
}
