#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef pair<int,int> P ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define chmin(a,b) a = min(a,b) ;

const int mod = 1000000007 ;

int n , k ;
vector<int> digit ;

ll powmod(ll x , ll n){
    ll res = 1 ;
    while(n > 0){
        if(n & 1) (res *= x) %= mod ;
        (x *= x) %= mod ;
        n >>= 1 ;
    }
    return res ;
}

int main(){
    cin >> n ;
    rep(i,9){
        int c ;
        cin >> c ;
        rep(j,c){
            digit.push_back(i+1) ;
        }
    }
    sort(digit.begin(),digit.end()) ;
    ll res = 0 ;
    do{
        rep(i,n) (res += digit[i] * powmod(10,i) % mod) %= mod ;
    } while (next_permutation(digit.begin(),digit.end()));
    cout << res << endl ;
}