#include <iostream>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <string.h>
#include <iomanip>
#include <unordered_set>

#define int long long

using namespace std;

const int N = 5e3 + 9;
const int mod = 1e9 + 7;

int n, h;
int k[N];
int s[N];
int f[N];
int dp[N];

void setup()
{
	f[0] = 1;
	for (int i = 1; i <= n; i++)
	{
		f[i] = (f[i - 1] * i) % mod;
	}
}

int solve()
{
	if (s[h] == n) return 0;
	setup();
	if (h == 0) return f[n];

	dp[h] = (f[n - s[h - 1]]  + mod - (f[k[h]] * f[n - s[h]]) % mod) % mod;
	for (int i = h - 1; i >= 1; i--)
	{
		int currS = s[h] - s[i - 1];
		int currN = n - s[i - 1];
		dp[i] = (f[currN]  + mod - (f[currS] * f[currN - currS]) % mod) % mod;
		for (int j = h - 1; j >= i; j--)
		{
			dp[i] = (dp[i] + mod - (f[currS - s[h] + s[j]] * dp[j + 1]) % mod) % mod;
		}
	}
	return dp[1];
}

signed main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
	if (fopen("data.inp", "r")) 	
	{
		freopen ("data.inp", "r", stdin);
		freopen ("data.out", "w", stdout);
	}
	cin >> n >> h;
	for (int i = 1; i <= h; i++)
	{
		cin >> k[i];
		s[i] = s[i - 1] + k[i];
	}
	cout << solve();
    return 0;
}