#include <stdio.h>

const int Mod = 1000000007;
long long fact[200001], fact_inv[200001];

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long combination(int n, int k)
{
	return fact[n] * fact_inv[k] % Mod * fact_inv[n-k] % Mod;
}

int main()
{
	int i, j, N, c[10];
	scanf("%d", &N);
	for (i = 1; i <= 9; i++) scanf("%d", &(c[i]));
	for (i = 1, fact[0] = 1; i <= N; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = N - 1, fact_inv[N] = div_mod(1, fact[N], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;
	
	int k;
	long long ans = 0, tmp = 1, comb[10];
	for (i = 1; i <= 9; i++) {
		if (c[i] == 0) comb[i] = 0;
		else {
			for (j = 1, k = N - 1, comb[i] = 1; j <= 9; j++) {
				if (j == i) {
					comb[i] = comb[i] * combination(k, c[j] - 1) % Mod;
					k -= c[j] - 1;					
				} else {
					comb[i] = comb[i] * combination(k, c[j]) % Mod;
					k -= c[j];
				}
			}
		}
	}
	for (i = 1; i <= N; i++, tmp = tmp * 10 % Mod) {
		for (j = 1; j <= 9; j++) ans += tmp * j * comb[j] % Mod;
	}
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}