//Date: 2025-02-08 09:39:47
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lll __int128
#define P emplace_back
#define CLEAR(a,v) memset(a,(v),sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
//char buf[1<<20],*p1,*p2;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
inline int rd() {
    int s=0,m=0;char ch=getchar();
    while(!isdigit(ch)) {if(ch=='-')m=1;ch=getchar();}
    while( isdigit(ch)) s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
    return m?-s:s;
}
bool MBE;
namespace SOLVER {
const int N=5e6,M=1e9+7,M1=998244353,M2=167772161,M3=469762049,gt=3;
int rv[10000005];int init(int n) {
    int nn=1,k=0;while(nn<=n) nn<<=1,k++;
    for(int i=0;i<(1<<k);i++) rv[i]=(rv[i>>1]>>1)|((i&1)<<(k-1));return nn;
}
template <int m> int qpow(int x,int y=m-2) {int s=1;for(;y;y>>=1,x=1ll*x*x%m) if(y&1) s=1ll*s*x%m;return s;}
const int inv1=qpow<M2>(M1),inv2=qpow<M3>(1ll*M1*M2%M3);
template <int m> void ntt(int f[],int n,int fl) { 
    int ginv=qpow<m>(gt);for(int i=0;i<n;i++) if(i<rv[i]) swap(f[i],f[rv[i]]);
    for(int i=1,x,y,gi;i<n;i*=2) {
        gi=qpow<m>((fl==1?gt:ginv),(m-1)/i/2);
        for(int j=0;j<n;j+=i*2) for(int k=j,g=1;k<i+j;k++,g=1ll*g*gi%m)
            x=f[k],y=1ll*g*f[k+i]%m,f[k]=(x+y)%m,f[k+i]=(x-y+m)%m;
    }
    if(fl==-1) for(int i=0,ninv=qpow<m>(n);i<n;i++) f[i]=1ll*f[i]*ninv%m;
}
int x,y,z,a[3][10000005],b[3][10000005],fac[5000005],ifac[5000005],ans;
int C(int n,int m) {return n<m||m<0?0:1ll*fac[n]*ifac[m]%M*ifac[n-m]%M;}
void MAIN() {
    cin>>x>>y>>z;if(!x&&!y&&!z) {puts("1");return;}
    fac[0]=1;rep(i,1,N) fac[i]=1ll*fac[i-1]*i%M;ifac[N]=qpow<M>(fac[N]);per(i,N,1) ifac[i-1]=1ll*ifac[i]*i%M;
    rep(i,0,x+y+z) a[0][i]=a[1][i]=a[2][i]=(i%2?(M-ifac[i])%M:ifac[i]),b[0][i]=b[1][i]=b[2][i]=1ll*C(x+i-1,i-1)*C(y+i-1,i-1)%M*C(z+i-1,i-1)%M*ifac[i]%M;
    int nn=init((x+y+z)*2);
    ntt<M1>(a[0],nn,1),ntt<M1>(b[0],nn,1),ntt<M2>(a[1],nn,1),ntt<M2>(b[1],nn,1),ntt<M3>(a[2],nn,1),ntt<M3>(b[2],nn,1);
    rep(i,0,nn-1) a[0][i]=1ll*a[0][i]*b[0][i]%M1,a[1][i]=1ll*a[1][i]*b[1][i]%M2,a[2][i]=1ll*a[2][i]*b[2][i]%M3;
    ntt<M1>(a[0],nn,-1),ntt<M2>(a[1],nn,-1),ntt<M3>(a[2],nn,-1);
    rep(i,0,x+y+z) {
        lll x=(lll)(a[1][i]-a[0][i]+M2)%M2*inv1%M2*M1+a[0][i];
        int val=(((lll)(a[2][i]-x%M3+M3)%M3*inv2%M3*(1ll*M1%M*M2%M)%M+x%M)%M+M)%M;
        ans=(ans+1ll*val*fac[i])%M;
    }
    cout<<(ans%M+M)%M<<endl;
}
}
bool MED;
signed main() {
    //freopen(".in","r",stdin);freopen(".out","w",stdout);
    for(int tt=1;tt;tt--) SOLVER::MAIN();
    cerr<<(&MBE-&MED)/1024<<" KB, "<<1000*clock()/CLOCKS_PER_SEC<<" ms\n";
    return 0;
}