#include <bits/stdc++.h>

typedef long long ll;

const int N = 1010;
const int K = 22;
const ll EAtxdy = 1000000007;

using namespace std;

ll n, k;
ll a[K], factorial[N];
ll dp[K][N];
ll combination[N][N];

inline ll read() {
	ll x = 0, f = 1; char c = getchar();
	while (!isdigit(c)) {
		if (c == '-') f = -1;
		c = getchar();
	}
	while (isdigit(c)) {
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x * f;
}

void init() {
	for (ll i = 0; i <= n; i++) {
		for (ll j = i; j <= n; j++) {
			if (i == 0) combination[j][i] = 1;
			else combination[j][i] = (combination[j - 1][i] + combination[j - 1][i - 1]) % EAtxdy;
		}
	}
}

signed main() {
	n = read(), k = read();
	init();
	for (ll i = 1; i <= k; i++) {
		a[i] = read();
	}
	dp[0][0] = 1;
	for (ll i = 0; i < k; i++) {
		for (ll j = 0; j <= n; j++) {
//			printf("%lld ", dp[i][j]);
			for (ll f = 0; f <= a[i + 1] && f + j <= n; f++) {
				dp[i + 1][j + f] = (dp[i + 1][j + f] % EAtxdy + dp[i][j] * combination[n - j][f] % EAtxdy * combination[n - f][a[i + 1] - f] % EAtxdy + EAtxdy) % EAtxdy;
			}
		}
//		puts("");
	}
	printf("%lld\n", dp[k][n] % EAtxdy);
	return 0;
}
