#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=(a); i<(n); i++)
#define rrep(i,a,n) for(int i=(a); i>=(n); i--)
#define all(n) begin(n),end(n)
#define rall(n) rbegin(n),rend(n)
//#define yn(bool) if(bool){cout<<Yes<<endl;}else{cout<<No<<endl;}
#define fore(i,a) for(auto &i:a)
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
ll myceil(ll a,ll b){return (a+(b-1))/b;}
ll myfloor(ll a,ll b){return a/b;}
template <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}
template <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }

void _main() {
	int n;
	cin>>n;
	vi a(9);
	rep(i,0,9) cin>>a[i];
	vector<char> b;
	rep(i,0,9) {
		int an = a[i];
		rep(j,0,an) b.push_back(i+1+'0');
	}
	sort(all(b));
	ll ans=0;
	do{
		string k;
		rep(i,0,n) {
			k+=b[i];
		}
		cout<<k<<endl;
		ans+=stoll(k)%1000000007;
		ans%=1000000007;
	}while(next_permutation(all(b)));
	cout<<ans<<endl;
}