#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 <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
using mint = modint<1000000007>;
int main() {
	int X, Y, Z;
	cin >> X >> Y >> Z;
	int lim = 2 * (X + Y + Z);
	vector<mint> fact(lim + 1), inv(lim + 1), factinv(lim + 1);
	fact[0] = 1; inv[1] = 1; factinv[0] = 1;
	for (int i = 1; i <= lim; ++i) fact[i] = fact[i - 1] * i;
	for (int i = 2; i <= lim; ++i) inv[i] = inv[mint::get_mod() % i] * mint(-int(mint::get_mod() / i));
	for (int i = 1; i <= lim; ++i) factinv[i] = factinv[i - 1] * inv[i];
	function<mint(int, int)> comb = [&](int x, int y) {
		if (y < 0 || x < y) return mint(0);
		return fact[x] * factinv[y] * factinv[x - y];
	};
	mint ans = 0;
	for (int i = 1; i <= X + Y + Z; ++i) {
		mint mul = comb(X + i - 1, X) * comb(Y + i - 1, Y) * comb(Z + i - 1, Z);
		for (int j = i; j <= X + Y + Z; ++j) {
			mint submul = comb(j, i);
			if ((j - i) % 2 == 0) ans += mul * submul;
			else ans -= mul * submul;
		}
	}
	cout << ans.get() << endl;
	return 0;
}