import java.math.*;
import java.util.*;
import java.io.*;

class Main
{
    public static void main(String[] args)
    {
        new Main().run();
    }
    
    long MOD=(long)1e9+7;
    
    int MAX=1123456;
    
    long[] fac = new long[MAX];
    long[] ifac = new long[MAX];
    long[] inv = new long[MAX];
    long[] pw2 = new long[MAX];
    
    {
        fac[0]=fac[1]=ifac[0]=ifac[1]=inv[0]=inv[1]=pw2[0]=1;
        pw2[1]=2;
        for (int i=2; i < fac.length; ++i) {
            fac[i] = i*fac[i-1]%MOD;
            inv[i] = MOD-inv[(int)(MOD%i)]*(MOD/i)%MOD;
            ifac[i] = inv[i]*ifac[i-1]%MOD;
            pw2[i]=2*pw2[i-1]%MOD;
        }
    }
    
    void run() {
        Scanner sc=new Scanner(System.in);
        int X=sc.nextInt();
        int Y=sc.nextInt();
        int Z=sc.nextInt();
        System.out.println(solve(X,Y,Z));
    }
    
    long comb(int n, int k) {
        return fac[n]*ifac[k]%MOD*ifac[n-k]%MOD;
    }
    
    long solve(int X, int Y, int Z) {
        if (X==0&&Y==0&&Z==0) return 1;
        long ret=0;
        for (int i=0;i<=Math.min(X,Y);++i) {
            for (int j=0;j<=Math.min(Z,X+Y-i);++j) {
                long add=comb(X+Y+Z-i-j,X+Y-i)*comb(X,i)%MOD*comb(X+Y-i,X)%MOD*comb(X+Y-i,j)%MOD*pw2[X+Y+Z-i-j-1]%MOD;
                if ((i+j)%2==0) ret=(ret+add)%MOD;
                else ret=(ret-add+MOD)%MOD;
            }
        }
        return ret;
    }
    
}