// OK that is my fault.
// ===================================
//   author: M_sea
//   website: http://m-sea-blog.com/
// ===================================
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#define re register
using namespace std;

inline int read() {
    int X=0,w=1; char c=getchar();
    while (c<'0'||c>'9') { if (c=='-') w=-1; c=getchar(); }
    while (c>='0'&&c<='9') X=X*10+c-'0',c=getchar();
    return X*w;
}

const int N=900000+10;

const int mod=1e9+7;
inline int qpow(int a,int b) { int c=1;
    for (;b;b>>=1,a=1ll*a*a%mod) if (b&1) c=1ll*c*a%mod;
    return c;
}

int fac[N],ifac[N],pw[N];
inline void init(int n) {
    fac[0]=1;
    for (re int i=1;i<=n;++i) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[n]=qpow(fac[n],mod-2);
    for (re int i=n;i;--i) ifac[i-1]=1ll*ifac[i]*i%mod;
    for (re int i=pw[0]=1;i<=n;++i) pw[i]=3ll*pw[i-1]%mod;
}

inline int C(int n,int m) {
    return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}

int main() { init(900000);
    int n=read(),m=read(),k=read(); if (m<k) swap(m,k);
    int ans=0,lst=1;
    for (re int i=0;i<=m+k;++i) {
        ans=(ans+1ll*C(n+i-1,n-1)*pw[m+k-i]%mod*lst)%mod;
        if (i<k) lst=2ll*lst%mod;
        else if (i<m) lst=(2ll*lst+mod-C(i,k))%mod;
        else lst=(2ll*lst+mod-C(i,k)+mod-C(i,i-m))%mod;
    }
    printf("%d\n",ans);
    return 0;
}
