#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=10007;
ll yang[10001][101],a,ji=1,n,m;
int main(){
	cin>>n>>m;
	yang[0][0]=1;
	for (ll i=1;i<=10000;i++) for (ll j=0;j<=i && j<=100;j++) yang[i][j]=(yang[i-1][j]+yang[i-1][j-1])%mod;
	while (m--){
		cin>>a;
		ji=ji*yang[n][a]%mod;
		n-=a;
		if (n<0){
			cout<<0;
			return 0;
		}
	}
	cout<<ji;
}