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

constexpr int mod = 1000000007;

long long fac[200005], finv[200005], inv[200005];

void COMinit() {
    fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
    for (int i = 2; i < 200005; i++) {
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

int main() {
    COMinit();
    int N;
    cin >> N;
    vector<int>tmp(9);
    long long ans = 0;
    for(int i = 0; i < 9; i++) {
        cin >> tmp[i];
    }
    for(int i = 0; i < 9; i++) {
        long long tmp2 = COM(N-1,tmp[i]-1);
        long long sum = N-tmp[i];
        for(int j = 0; j < 9; j++) {
            if(i != j) {
                tmp2 *= COM(sum,tmp[j]);
                tmp2 %= mod;
                sum -= tmp[j];
            }
        }
        sum = 1;
        for(int j = 0; j < N; j++) {
            ans += sum*tmp2%mod*(i+1)%mod;
            ans %= mod;
            sum *= 10;
            sum %= mod;
        }
    }
    cout << ans << endl;
}