#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 1e-5
#define LONG_INF 1000000000000000000LL
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144*4
#define REP(a,b) for(long long a = 0;a < b;++a)
long long powing(long long now, long long b) {
	long long ans = 1;
	while (b != 0) {
		if (b % 2) {
			ans *= now;
			ans %= MAX_MOD;
		}
		b /= 2;
		now *= now;
		now %= MAX_MOD;
	}
	return ans;
}
long long inv(long long now) {
	return powing(now, MAX_MOD - 2LL);
}
long long mae[500000];
long long gyaku[500000];
long long comb(long long a, long long b) {
	long long ans = mae[b];
	ans *= gyaku[a];
	ans %= MAX_MOD;
	ans *= gyaku[b - a];
	ans %= MAX_MOD;
	return ans;
}
int main() {
	mae[0] = 1;
	gyaku[0] = 1;
	for (long long i = 1; i < 500000; ++i) {
		mae[i] = mae[i - 1] * i;
		mae[i] %= MAX_MOD;
		gyaku[i] = inv(mae[i]);
	}
	long long a, b, c;
	cin >> a >> b >> c;
	a--;
	b--;
	long long ans = 0;
	while (a != -1) {
		//Choose B and starting!
		//期待値ゲー
		long long percent = c * inv(a + b + c); // cを選ぶ確率
		long long toori = (comb(a, a + b + c) * comb(b, b + c)) % MAX_MOD;//通り数
		long long tmp = (powing(2LL, a + b + c) + MAX_MOD - 1LL) % MAX_MOD;
		percent %= MAX_MOD;
		ans += (((percent * toori) % MAX_MOD) * tmp) % MAX_MOD;
		ans %= MAX_MOD;
		//choose A and continue
		a--;
	}
	cout << ans << endl;
	return 0;
}