#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return n<k||k<0 ? 0 : fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll a, b, c; cin >> a >> b >> c;

  c_fac();
  ll p2[a+b+c] = {}; rep(i,a+b+c) p2[i] = i==0 ? 1 : p2[i-1]*2%MOD;
  ll result = 0;
  repr(i,2,a+b+1) {
    ll xy = nck(a+b-1,a-1);
    if (i<=a) xy = (xy-nck(a+b-i, a-i)+MOD) % MOD;
    // cout << count << endl;
    ll z = p2[(a+b+c-1)-i]*nck((a+b+c-1)-i, c-1)%MOD;
    z = (z + (p2[(a+b+c-1)-i]-1)*nck((a+b+c-2)-i, c-2)) % MOD;
    // cout << xy << " " << z << endl;
    result = (result+xy*z) % MOD;
  }
  cout << result << endl;
  return 0;
}