#include<iostream>  
#include<algorithm>
using namespace std;
typedef long long LL;
const int N = 110;

int n, m;
int a[N];
LL rs = 1;

LL get_value(int n, int v, int mod) {
    LL nsum = 1,vsum = 1;
    int count;
    for (int i = n, count = v; count >= 1; count--, i--) {
        nsum = (nsum * i) % mod;
    }
    for (int i = v, count = v; count >= 1 && i >= 1; count--, i--) {
        vsum = (vsum * i) % mod;
    }
    return nsum / vsum;
}
int main() {
    cin >> n >> m;
    int sum = 0;
    for (int i = 1; i <= m; i++) {
        cin >> a[i];
        sum += a[i];
    }
    if(sum > n){
        cout << 0 << endl;
        return 0;
    }
    for (int i = 1; i <= m; i++) {
        rs = (rs * get_value(n, a[i], 10007)) % 10007;
        n -= a[i];
    }
    cout << rs << endl;
    return 0;
}