#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > a;
long long MOD = 1e9 + 7;
long long n, m, k;
long long inv(long long x) {
  long long y = MOD - 2, res = 1;
  for (; y; y >>= 1, x = x * x % MOD)
    if (y & 1) res = res * x % MOD;
  return res;
}
long long C(int n, int m) {
  if (m > n) {
    return 0;
  }
  long long ans = 1;
  for (int i = 1; i <= m; i++) {
    ans = ans * (n - i + 1) % MOD * inv(i) % MOD;
  }
  return ans;
}
int main() {
  cin >> n >> m >> k;
  cout << ((C(n - 2, 2 * k) * C(m - 2, 2 * k) % MOD) +
           (C(n - 2, 2 * k - 1) * C(m - 2, 2 * k - 1) % MOD) +
           (C(n - 2, 2 * k - 1) * C(m - 2, 2 * k) % MOD) +
           (C(n - 2, 2 * k) * C(m - 2, 2 * k - 1) % MOD)) %
              MOD;
  return 0;
}
