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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/modint>
using mint = atcoder::modint1000000007;

int main() {
    int n; cin >> n;
    int c[9] = {};
    for (auto &e : c) cin >> e;

    auto f = vec<mint>(uns, n + 1);

    f[0] = 1;
    for (int i = 1; i <= n; ++i) {
        f[i] = f[i - 1] * i;
    }

    mint ans = 0;
    for (int i = 1; i <= 9; ++i) {
        if (c[i - 1] == 0) {
            continue;
        }

        mint p = f[n - 1];
        for (int j = 1; j <= 9; ++j) {
            p /= f[c[j - 1] - (i == j)];
        }

        for (int j = 0; j < n; ++j) {
            ans += i * mint(10).pow(j) * p;
        }
    }

    cout << ans.val() << endl;
}