#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long mod = 1000000007;
long long m_pow(long long x, long long y) {
	long long ans = 1;
	while (y > 0) {
		if ((y & 1) == 1) {
			ans = ans * x % mod;
		}
		x = x * x % mod;
		y >>= 1;
	}
	return ans;
}
long long fac[200020], finv[200020], inv[200020];
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < 200020; 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(long long n, long long k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long k[200020];
long long c[10];
int main() {
	COMinit();
	long long n;
	cin >> n;
	long long ans = 0;
	long long sum = 0, p = 1;
	for (int i = 1; i <= 9; i++) {
		cin >> c[i];
	}
	long long s = 1;
	for (long long i = 0; i <= n; i++) {
		k[i] = s;
		s *= (i + 1);
		s %= mod;
		if (i != n) {
			sum += p;
			p *= 10;
			sum %= mod;
			p %= mod;
		}
	}
	for (long long i = 1; i <= 9; i++) {
		long long k1 = 1;
		for (long long j = 1; j <= 9; j++) {
			k1 *= k[c[j]];
			k1 %= mod;
		}
		ans += sum * i * c[i] % mod * k[n - 1] % mod * m_pow(k1, mod - 2) % mod;
		ans %= mod;
	}
	cout << ans << endl;
}