//#include <atcoder/all>
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
vector<ll> fact, factinv, inv;
ll mod = 1e9 + 7;
void prenCkModp(ll n) {
	fact.resize(n + 5);
	factinv.resize(n + 5);
	inv.resize(n + 5);
	fact.at(0) = fact.at(1) = 1;
	factinv.at(0) = factinv.at(1) = 1;
	inv.at(1) = 1;
	for (ll i = 2; i < n + 5; i++) {
		fact.at(i) = (fact.at(i - 1) * i) % mod;
		inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;
		factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;
	}

}
ll nCk(ll n, ll k) {
	if (n < k) return 0;
	return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;
}
int main() {
	ll N;
	cin>>N;
	prenCkModp(N);
	vll C(9);
	rep(i,9)cin>>C[i];
	vll D(9);
	rep(i,9){
		if(C[i]==0)D[i]=0;
		else{
			ll res=fact[N-1];
			rep(j,9){
				if(i==j){
					res*=factinv[C[j]-1];

				}
				else{
					res*=factinv[C[j]];
				}
				res%=mod;
			}
			D[i]=res;
		}
		
	}
	ll k=1;
	ll an=0;
	rep(i,N){
		rep(j,9){
			an+=D[j]*(j+1)*k;
			an%=mod;
		}
		k*=10;
		k%=mod;
	}
	
	cout<<an<<endl;

}