cf554C

C. Kyoya and Colored Balls

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Kyoya Ootori has a bag with n colored balls that are colored with k different colors. The colors are labeled from 1 to k. Balls of the same color are indistinguishable. He draws balls from the bag one by one until the bag is empty. He noticed that he drew the last ball of color ibefore drawing the last ball of color i + 1 for all i from 1 to k - 1. Now he wonders how many different ways this can happen.

Input

The first line of input will have one integer k (1 ≤ k ≤ 1000) the number of colors.

Then, k lines will follow. The i-th line will contain ci, the number of balls of the i-th color (1 ≤ ci ≤ 1000).

The total number of balls doesn't exceed 1000.

Output

A single integer, the number of ways that Kyoya can draw the balls from the bag as described in the statement, modulo 1 000 000 007.

Examples

input

3
2
2
1

output

3

input

4
1
2
3
4

output

1680

Note

In the first sample, we have 2 balls of color 1, 2 balls of color 2, and 1 ball of color 3. The three ways for Kyoya are:

1 2 1 2 3
1 1 2 2 3
2 1 1 2 3

题意：有K种颜色的球给出每种颜色的球的数量然后将N个球图成给定的这N个球的数量限制条件在i颜色必须在i+1颜色涂完前涂完。

解题思路：考虑前i中颜色的球已经涂好现在要图第i+1种球设第i+1中颜色的球的数量为N则有之前已经排好序的球的数量为m即将N-1个球插入的已经排好的m个球中既有m+1个空格可插即可，即N个球插入M个盒子有多少种插法即共有（N+（M-1）)!/（N!*（M-1）!）;考虑数过大求逆元即可，和cf300C题类似

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
#define MOD 1000000007
using namespace std;
const int maxn=10010;
long long num[maxn];
long long F[maxn<<1];
void init(){
	F[0]=F[1]=1;
	for(long long i=2;i<=1000;++i){
		F[i]=F[i-1]*i%MOD;
	}
}
long long Pow(long long a,long long b){    
    if(b==0)return 1%MOD;    
    long long t=Pow(a,b>>1);    
    t=t*t%MOD;    
    if(b&1)t=t*a%MOD;    
    return t;     
}  
//(n+m)!/(n!*m!) 
int main()
{
	init();
	int n,i,j,k;
	scanf("%d",&n);
	for(i=1;i<=n;++i){
		scanf("%d",&num[i]);
	}
	if(n==1){
		printf("1\n");
	}
	else {
		long long cnt=num[1],ans=1;
		for(i=2;i<=n;++i){
			long long b=F[cnt]*F[num[i]-1]%MOD;
			ans=ans*(F[cnt+num[i]-1]*Pow(b,MOD-2)%MOD)%MOD;
			cnt+=num[i];
		}
		printf("%lld\n",ans);
	}
	return 0;
}