/*
    author:  Maksim1744
    created: 11.01.2020 14:26:02
*/

#include <bits/stdc++.h>

using namespace std;

#define ll   long long
#define ld   long double

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T>& v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T>& v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T>& v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>& v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>& p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define TAG_LENGTH       25
#define LR_LEFT          left
#define LR_RIGHT         right
#define LR_VALUE         value
#define LR_SECOND_VALUE  mn
#include "C:/C++ libs/print.cpp"
#else
#define showl            42;
#define shows            42;
#define show(...)        42;
#define showm(...)       42;
#define showt(...)       42;
#define printTree(...)   42;
#define printGraph(...)  42;
#define printLRTree(...) 42;
#define printMatrix(...) 42;
#define printWGraph(...) 42;
#define debug     if (false)
#endif

template<int P>
struct Modular {
    using value_type = decltype(P);
    value_type value;

    Modular(ll k = 0) : value(norm(k)) {}

    Modular& operator += (const Modular& m)       { value += m.value; if (value >= P) value -= P; return *this; }
    Modular  operator +  (const Modular& m) const { Modular r = *this; return r += m; }

    Modular& operator -= (const Modular& m)       { value -= m.value; if (value <  0) value += P; return *this; }
    Modular  operator -  (const Modular& m) const { Modular r = *this; return r -= m; }
    Modular  operator -                     () const { return Modular(-value); }

    Modular& operator *= (const Modular &m)       { value = value * 1ll * m.value % P; return *this; }
    Modular  operator *  (const Modular& m) const { Modular r = *this; return r *= m; }

    Modular& operator /= (const Modular &m)       { return *this *= m.inv(); }
    Modular  operator /  (const Modular& m) const { Modular r = *this; return r /= m; }

    Modular& operator ++                    ()       { return *this += 1; }
    Modular& operator --                    ()       { return *this -= 1; }
    Modular  operator ++                 (int)       { Modular r = *this; r += 1; return r; }
    Modular  operator --                 (int)       { Modular r = *this; r -= 1; return r; }

    bool        operator == (const Modular& m) const { return value == m.value; }
    bool        operator != (const Modular& m) const { return value != m.value; }

    value_type norm(ll k) {
        if (!(-P <= k && k < P)) k %= P;
        if (k < 0) k += P;
        return k;
    }

    Modular inv() const {
        value_type a = value, b = P, x = 0, y = 1;
        while (a != 0) { value_type k = b / a; b -= k * a; x -= k * y; swap(a, b); swap(x, y); }
        return Modular<P>(x);
    }
};

template<int P> Modular<P> pow(Modular<P> m, ll p) {
    Modular<P> r(1);
    while (p) {
        if (p & 1) r *= m;
        m *= m;
        p >>= 1;
    }
    return r;
}

template<int P> ostream& operator << (ostream& o, const Modular<P> m) { return o << m.value; }
template<int P> istream& operator >> (istream& i,       Modular<P> m) { ll k; i >> k; m.value = m.norm(k); return i; }
template<int P> string   to_string(const Modular<P>& m) { return to_string(m.value); }

using Mint = Modular<1000000007>;
// using Mint = Modular<998244353>;
// using Mint = long double;

const int N = 1010;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    array<Mint, N> f, fi;
    f[0] = 1;
    for (int i = 1; i < N; ++i)
        f[i] = f[i - 1] * i;
    fi.back() = Mint(1) / f.back();
    for (int i = N - 2; i >= 0; --i)
        fi[i] = fi[i + 1] * (i + 1);
    auto C = [&](int n, int k) {
        if (k < 0 || k > n) return Mint(0);
        return f[n] * fi[k] * fi[n - k];
    };

    int n, k;
    cin >> n >> k;
    vector<int> a(k);
    cin >> a;
    vector<Mint> prev(n + 1, 0);
    vector<Mint> next(n + 1, 0);
    for (int i = 0; i <= n; ++i)
        prev[i] = C(a[0], i) / C(n, i);
    for (int i = 1; i < k; ++i) {
        next.assign(n + 1, 0);
        for (int j = 0; j <= n; ++j) {
            for (int u = 0; u <= j; ++u) {
                next[j] += C(j, u) * C(a[i], u) / C(n, u) * prev[j - u];
            }
        }

        swap(prev, next);
    }
    Mint ans = prev.back();
    for (auto u : a) {
        ans *= C(n, u);
    }
    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 256