#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;

// Problem Specific Parameter:
const ll mod=1000000007LL;
const int limit=1000000;
vector<ll> fact(limit+1),rfact(limit+1);
	
ll power(ll a,ll n){
	ll b=1LL;
	while(n){
		if(n&1) b=b*a%mod;
		a=a*a%mod;
		n>>=1;
	}
	return b;
}

void init(){
	fact[0]=1LL;
	rep(i,1,limit+1) fact[i]=1LL*i*fact[i-1]%mod;
	rfact[limit]=power(fact[limit],mod-2);
	rrep(i,limit+1,1) rfact[i-1]=i*rfact[i]%mod;
}

inline ll C(ll n,ll k){
	if(k<0 or n<k) return 0LL;
	return fact[n]*rfact[k]%mod*rfact[n-k]%mod;
}

int main(void){
	init();

	ll n,m,k;
	cin >> n >> m >> k;

	ll ans=0LL,mid=1LL;
	rep(t,n,n+m+k+1){
		ll lft=C(t-1,n-1);
		ll rgt=power(3LL,n+m+k-t);
		ans+=1LL*lft*mid%mod*rgt%mod;
		//cout << mid << endl;
		ans%=mod;
		mid=2LL*mid%mod;
		mid=(mid+2LL*mod-C(t-n,t-n-k)-C(t-n,m))%mod;
	}

	cout << ans << endl;
	return 0;
}