#include #define int long long using namespace std; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } template class modint { private: int val; public: int value(){ return val; } modint(int x=0){ val=x%mod; } modint pow(int n){ modint res(1),x(val); while(n>0){ if(n&1) res*=x; x*=x; n>>=1; } return res; } modint inv(){ return pow(mod-2); } modint& operator+=(modint rhs){ val+=rhs.val; if(val>=mod) val-=mod; return *this; } modint& operator-=(modint rhs){ val+=mod-rhs.val; if(val>=mod) val-=mod; return *this; } modint& operator*=(modint rhs){ val=val*rhs.val%mod; return *this; } modint& operator/=(modint rhs){ *this*=rhs.inv(); return *this; } modint operator+(modint rhs){ return modint(val)+=rhs; } modint operator-(modint rhs){ return modint(val)-=rhs; } modint operator*(modint rhs){ return modint(val)*=rhs; } modint operator/(modint rhs){ return modint(val)/=rhs; } }; const int mod=1e9+7; const int sz=300010; int fact[sz],inv[sz],ifact[sz]; void make(){ fact[0]=fact[1]=inv[1]=ifact[0]=ifact[1]=1; for(int i=2;i; int a,b,c; cin>>a>>b>>c; int N=a+b+c; vector sum(N+1); for(int i=0;i=0;i--){ int need=N-i-1; if(need>a) break; a-=need; mint x=comb(i-1,a); mint y=comb(i-1-a,b-1); ans+=sum[i]*x*y; a+=need; } cout<