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 int long long
const int MAX = 510000;
const int MOD = 1000000007;
//
int fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
// 二項係数計算
int COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
        signed main() {
            COMinit();
            int n,k;
            cin>>n>>k;
           int a[k];
           for(int i=0;i<k;i++)cin>>a[i];
           int dp[k][n+1];
           for(int i=0;i<=n;i++)dp[0][i]=(finv[i]*COM(n-i,a[0]-i))%MOD;
           for(int i=1;i<k;i++){
               for(int j=0;j<=n;j++){
                   dp[i][j]=0;
                   for(int jj=0;jj<=j;jj++){
                       dp[i][j]=(dp[i][j]+ ((dp[i-1][jj]*finv[j-jj])%MOD)*COM(n-(j-jj),a[i]-(j-jj))%MOD)%MOD;
                       
                   }
                  
               }
           }
           cout<<dp[k-1][n]*fac[n]%MOD<<endl;
         return 0;

        }
