Pagini recente » Cod sursa (job #2127597) | Cod sursa (job #3209227) | Cod sursa (job #2793710) | Cod sursa (job #1055704) | Cod sursa (job #2712122)
#include <fstream>
using namespace std;
ifstream cin("hagi.in");
ofstream cout("hagi.out");
long long k,n,m,mod=1000000007;
long long lgput(int x, int n)
{
if ( n == 0 ) return 1;
int res = lgput(x, n >>1);
res = (1LL * res * res) % mod;
if ( n&1 )
res = (1LL * res * x) % mod;
return res;
}
long long comb(long long n,long long k) {
long long fact1=1,fact2=1,fact3=1;
for(long long i=1;i<=n;i++)
fact1=(1LL * fact1*i)%mod;
for(long long i=1;i<=k;i++)
fact2=(1LL * fact2*i)%mod;
for(long long i=1;i<=n-k;i++)
fact3=(1LL * fact3*i)%mod;
return (1LL * ((1LL * fact1 * lgput(fact2,mod-2))%mod) * lgput(fact3,mod-2)) % mod;
}
int main()
{
long long fact1=1,fact2=1,fact3=1,fact11=1,fact33=1;
int k,n,m;
cin>>k>>n>>m;
cout << (1LL * comb(k+n-1,k-1) * comb(m+k-1,k-1))%mod;
return 0;
}