import java.io.*; import java.util.*; public class Main { static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int[] counts = new int[10]; for (int i = 1; i < 10; i++) { counts[i] = sc.nextInt(); } long[] factorials = new long[n + 1]; long[] reverses = new long[n + 1]; factorials[0] = 1; reverses[0] = 1; long base = 0; for (int i = 1; i <= n; i++) { factorials[i] = factorials[i - 1] * i % MOD; reverses[i] = powmod(factorials[i], MOD - 2, MOD); base *= 10; base++; base %= MOD; } base *= factorials[n - 1]; base %= MOD; long ans = 0; for (int i = 1; i < 10; i++) { if (counts[i] == 0) { continue; } long tmp = base * i % MOD; for (int j = 1; j < 10; j++) { if (i == j) { tmp *= reverses[counts[j] - 1]; } else { tmp *= reverses[counts[j]]; } tmp %= MOD; } ans += tmp; ans %= MOD; } System.out.println(ans); } static long powmod(long x, long p, int m) { if (p == 0) { return 1; } else if (p % 2 == 0) { return powmod(x * x % m, p / 2, m); } else { return powmod(x, p - 1, m) * x % m; } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }