There are N children, numbered 1,2,\ldots,N. In the next K days, we will give them some cookies. In the i-th day, we will choose a_i children among the N with equal probability, and give one cookie to each child chosen. (We make these K choices independently.)

Let us define the happiness of the children as c_1 \times c_2 \times \ldots \times c_N, where c_i is the number of cookies received by Child i in the K days. Find the expected happiness multiplied by \binom{N}{a_1} \times \binom{N}{a_2} \times \ldots \times \binom{N}{a_K} (we can show that this value is an integer), modulo (10^{9}+7).

Constraints

* 1 \leq N \leq 1000
* 1 \leq K \leq 20
* 1 \leq a_i \leq N

Input

Input is given from Standard Input in the following format:


N K
a_1 a_2 \ldots a_K


Output

Print the answer.

Examples

Input

3 2
3 2


Output

12


Input

856 16
399 263 665 432 206 61 784 548 422 313 848 478 827 26 398 63


Output

337587117
#include <bits/stdc++.h>
using namespace std;
#define ri register int
const int N=1e3+5,K=25,mod=1e9+7;
int a[N],f[K][N],c[N][N]; 
inline int _add(ri x,ri y){
	return (x+=y)>=mod?x-mod:x;
}
int main(){
	ri n,k,i,j,x;
	scanf("%d%d",&n,&k);
	for(i=1;i<=k;++i) scanf("%d",&a[i]);
	for(i=0;i<=n;++i){
		c[i][0]=1;
		for(j=1;j<=i;++j)
			c[i][j]=_add(c[i-1][j],c[i-1][j-1]);
	//	for(j=0;j<=i;++j)
	//		printf("%d ",c[i][j]);
	//	puts("");
	}
	f[0][0]=1;
	for(i=1;i<=k;++i)
		for(j=0;j<=n;++j)
			for(x=0;x<=j&&x<=a[i];++x)
				f[i][j]=(f[i][j]+(long long)f[i-1][j-x]*c[n-(j-x)][x]%mod*c[n-x][a[i]-x])%mod;
	printf("%d\n",f[k][n]);
	return 0;
}