#include <bits/stdc++.h>
using namespace std;
int n, m, k;
const int MAX_N = 1050, MODD = 1e9 + 7;
long long Fact[MAX_N] = {1};
long long Fast_pow(long long a, long long b, long long c) {
  if (b == 0) return 1 % c;
  if (b % 2 == 0) {
    long long x = Fast_pow(a, b / 2, c);
    return (x * x) % c;
  }
  long long x = Fast_pow(a, b / 2, c);
  return (a * ((x * x) % c)) % c;
}
long long inverse(long long x, long long p) { return Fast_pow(x, p - 2, p); }
long long entekhab(int a, int b) {
  if (a > b || a < 0) return 0;
  return (((Fact[b] * inverse(Fact[a], MODD)) % MODD) *
          inverse(Fact[b - a], MODD)) %
         MODD;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> n >> m >> k;
  for (int i = 1; i <= max(n, m); ++i) {
    Fact[i] = (Fact[i - 1] * i) % MODD;
  }
  long long x1 = entekhab(2 * k, n - 1);
  long long x2 = entekhab(2 * k, m - 1);
  cout << (x1 * x2) % MODD;
}
