#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int inf=0x3f3f3f3f;
const ll infll=0x3f3f3f3f3f3f3f3f;
#define int long long
#define pii pair <int,int>
#define ld long double
#define endl "\n"
const int N=200050;
const int mod=1e9+7;
int a[N];
int frac[1000050];
int fracsf[1000050];
signed main (){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int n;
    cin >>n;
    int h;
    cin >>h;
    frac[0]=1;
    frac[1]=1;
    for (int i=2;i<=1000025;i++){
        frac[i]=frac[i-1]*i;
        frac[i]%=mod;

    }
   // cerr <<1<<endl;
    for (int i=1;i<=h;i++){
        cin >>a[i];
    }
   // cerr <<1<<endl;
    int sum=0;
    int sig=0;
    int sig2=0;
    for (int i=1;i<=h;i++){
        int presig=sig;
        sig+=a[i];
      //  cerr <<sig<<endl;
        sum+=frac[sig]*frac[n-sig];
        sum%=mod;
        if (i!=1)sig2+=((frac[a[i]]*frac[n-sig])%mod*frac[presig])%mod;
        sig2%=mod;
        sum-=sig2;
        sum+=mod*2;
        sum%=mod;
        //cout <<sum<<endl;
    }
    cout <<(mod+frac[n]-sum)%mod<<endl;

}