#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<string>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
using namespace std;
int read(){
    int xx=0,ff=1;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')ff=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){xx=xx*10+ch-'0';ch=getchar();}
    return xx*ff;
}
long long READ(){
    long long xx=0,ff=1;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')ff=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){xx=xx*10+ch-'0';ch=getchar();}
    return xx*ff;
}
char one(){
	char ch=getchar();
	while(ch==' '||ch=='\n')
		ch=getchar();
	return ch;
}
const int maxn=1000010,MOD=int(1e9)+7;
int N,M,K;
int fac[maxn],inv[maxn],invfac[maxn],pow3[maxn];
int C(int n,int m){
	if(n<m||m<0)
		return 0;
	return 1LL*fac[n]*invfac[n-m]%MOD*invfac[m]%MOD;
}
int main(){
	//freopen("in","r",stdin);
	pow3[0]=inv[0]=inv[1]=fac[0]=invfac[0]=1;
	for(int i=2;i<maxn;i++)
		inv[i]=1LL*(MOD-MOD/i)*inv[MOD%i]%MOD;
	for(int i=1;i<maxn;i++){
		pow3[i]=1LL*pow3[i-1]*3%MOD;
		fac[i]=1LL*fac[i-1]*i%MOD;
		invfac[i]=1LL*invfac[i-1]*inv[i]%MOD;
	}
	N=read(),M=read(),K=read();
	if(K>M)swap(M,K);
	int ans=0,cur=1;
	for(int i=0;i<=M+K;i++){
		ans=(ans+1LL*C(i+N-1,i)*pow3[M+K-i]%MOD*cur%MOD)%MOD;
		if(i<K)cur=cur*2%MOD;
		else if(i<M)cur=(1LL*cur*2-C(i,K)+MOD)%MOD;
		else cur=(1LL*cur*2-C(i,M)-C(i,K)+2*MOD)%MOD;
	}
	printf("%d\n",ans);
	return 0;
}
