#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

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

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin>>n;
    vector<int> c(10,0);
    for(int i = 1;i<=9;i++) cin>>c[i];
    mint ans = 0;
    vector<mint> p(n+1,0);
    p[0] = 1;
    for(int i = 1;i<=n;i++) p[i] = p[i-1] * 10;
    vector<mint> fac(n+1,1);
    for(int i = 1;i<=n;i++) fac[i] = fac[i-1] * i;

    for(int i = 1;i<=9;i++){
        if(c[i]==0) continue;
        c[i]--;
        for(int j = 0;j<n;j++){
            mint tmp = p[j] * i;
            int res = n - 1;
            for(int k = 1;k<=9;k++){
                if(c[k]==0) continue;
                tmp *= fac[res] * fac[res-c[k]].inv() * fac[c[k]].inv();
                res -= c[k];
            }
            ans += tmp;
        }
        c[i]++;
    }
    cout<<ans.val()<<endl;

}