#ifndef CLASS_MODINT
#define CLASS_MODINT

#include <cstdint>

template <std::uint32_t mod>
class modint {
private:
	std::uint32_t n;
public:
	modint() : n(0) {};
	modint(std::int64_t n_) : n((n_ >= 0 ? n_ : mod - (-n_) % mod) % mod) {};
	static constexpr std::uint32_t get_mod() { return mod; }
	std::uint32_t get() const { return n; }
	bool operator==(const modint& m) const { return n == m.n; }
	bool operator!=(const modint& m) const { return n != m.n; }
	modint& operator+=(const modint& m) { n += m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator-=(const modint& m) { n += mod - m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator*=(const modint& m) { n = std::uint64_t(n) * m.n % mod; return *this; }
	modint operator+(const modint& m) const { return modint(*this) += m; }
	modint operator-(const modint& m) const { return modint(*this) -= m; }
	modint operator*(const modint& m) const { return modint(*this) *= m; }
	modint inv() const { return (*this).pow(mod - 2); }
	modint pow(std::uint64_t b) const {
		modint ans = 1, m = modint(*this);
		while (b) {
			if (b & 1) ans *= m;
			m *= m;
			b >>= 1;
		}
		return ans;
	}
};

#endif // CLASS_MODINT

#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
const int lim = 200000;
using mint = modint<1000000007>;
int main() {
	vector<mint> fact(lim + 1), factinv(lim + 1);
	fact[0] = 1; factinv[0] = 1;
	for (int i = 1; i <= lim; ++i) {
		fact[i] = fact[i - 1] * i;
		factinv[i] = fact[i].inv();
	}
	function<mint(int, int)> comb = [&](int a, int b) {
		if (b < 0 || a < b) return mint(0);
		return fact[a] * factinv[b] * factinv[a - b];
	};
	int N, M, K;
	cin >> N >> M >> K;
	mint ans = 0;
	for (int i = 1; i <= (N + M - K) / 2; ++i) {
		ans += comb(N - 1, i - 1) * comb(M - 1, i - 1) * 2;
		ans += comb(N - 1, i) * comb(M - 1, i - 1);
		ans += comb(N - 1, i - 1) * comb(M - 1, i);
	}
	ans *= fact[N];
	ans *= fact[M];
	ans *= mint(N + M).inv();
	cout << ans.get() << endl;
	return 0;
}