#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 1000'000'007;

int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}
int sub(int a, int b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}
int mult(int a, int b)
{
	return (LL)a * b % mod;
}
const int N = 1'000'447;
int fact[N];

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	fact[0] = 1;
	FOR (i, 1, N) fact[i] = mult(fact[i - 1], i);
	
	int n;
	cin >> n;
	int k;
	cin >> k;
	int ans = fact[n];
	int sum = 0;
	VI vec(k);
	VI pref(k);
	FOR (i, 0, k)
	{
		cin >> vec[i];
		pref[i] = fact[vec[i]];
		if (i)
			pref[i] = mult(pref[i], pref[i - 1]);
	}
	
	FOR (i, 0, k)
	{
		int x = vec[i];
		sum += x;
		int l = fact[n - sum];
		int r = fact[sum];
		RFOR (j, i, 0)
		{
			r = sub(r, mult(fact[x], pref[j]));
			x += vec[j];
		}
		int d = mult(l, r);
		//cerr << l << ' ' << r << ' ' << d << '\n';
		ans = sub(ans, d);
	}
	cout << ans << '\n';
	
	
	return 0;
}