#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)s; i < (int)e; ++i)
#define all(a) (a).begin(), (a).end()

const ll mod = 1e9 + 7;

ll modpow(ll a, ll n, ll m) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % m;
        a = a * a % m;
        n >>= 1;
    }
    return res;
}

ll modinv(ll a, ll m) {
    return modpow(a, m - 2, m);
}

int main() {
    cin.tie(nullptr);
    
    ll N;
    cin >> N;
    vector<ll> c(9);
    rep(i, 0, 9) cin >> c[i];
    
    vector<ll> frac(2e5 + 10);
    frac[0] = 1;
    rep(i, 1, 2e5 + 10) frac[i] = frac[i - 1] * i % mod;
    
    ll ans = 0;
    rep(i, 0, 9) {
        if (c[i] == 0) continue;
        
        ll tmp = frac[N - 1];
        rep(j, 0, 9) {
            if (i == j) tmp *= modinv(frac[c[j] - 1], mod);
            else tmp *= modinv(frac[c[j]], mod);
            
            tmp %= mod;
        }
        ans += (i + 1) * tmp % mod;
        ans %= mod;
    }
    
    ans *= (modpow(10, N, mod) - 1 + mod) % mod;
    ans %= mod;
    ans *= modinv(9, mod);
    ans %= mod;
    
    cout << ans << '\n';
}