#include <bits/stdc++.h>
using namespace std;

const int maxN = 1005, mod = 1e9 + 7;

int N, K, a[maxN + 1];
int f[maxN + 1][maxN * 21 + 1];
int fac[maxN + 1], inv[maxN + 1];

inline int ADD(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }

inline int mpow(int a, int x)
{
	int ans = 1;
	while(x)
	{
		if(x & 1) ans = 1ll * ans * a % mod;
		a = 1ll * a * a % mod;
		x >>= 1;
	}
	return ans;
}

inline int C(int n, int m)
{
	if(n < m) return 0;
	return 1ll * fac[n] * inv[n - m] % mod * inv[m] % mod;
}

int main()
{
	scanf("%d %d", &N, &K);
	for(int i = 1; i <= K; i++) scanf("%d", &a[i]);
	
	fac[0] = 1;
	for(int i = 1; i <= N; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
	inv[N] = mpow(fac[N], mod - 2);
	for(int i = N - 1; i >= 0; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;

	f[0][0] = 1;
	for(int i = 1; i <= K; i++)
		for(int j = 0; j <= N; j++)
			for(int k = 0; k <= a[i]; k++)
				if(k <= j) 
					f[i][j] = ADD(f[i][j], 1ll * f[i - 1][j - k] * C(N - k, a[i] - k) % mod * inv[k] % mod);

	printf("%lld", 1ll * fac[N] * f[K][N] % mod);
	return 0;
}