/* -*- coding: utf-8 -*-
 *
 * 1629.cc:  No.1629 Sorting Integers (SUM of M) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MOD = 1000000007;

/* typedef */

typedef long long ll;

/* global variables */

int cs[10];
int fs[MAX_N + 1], invfs[MAX_N + 1];

/* subroutines */

int powmod(int a, int n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

inline int nck(int n, int k) {  // nCk % MOD
  return (ll)fs[n] * invfs[n - k] % MOD * invfs[k] % MOD;
}

void prepare_fracs(int n) {
  fs[0] = invfs[0] = 1;
  for (int i = 1; i <= n; i++) {
    fs[i] = (ll)fs[i - 1] * i % MOD;
    invfs[i] = powmod(fs[i], MOD - 2);
  }
}

inline void addmod(int &a, int b) { a = (a + b) % MOD; }
inline void mulmod(int &a, int b) { a = (ll)a * b % MOD; }

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= 9; i++) scanf("%d", cs + i);

  prepare_fracs(n);

  int tsum = 0;
  for (int i = 0, t = 1; i < n; i++, mulmod(t, 10))
    addmod(tsum, t);

  int p = 1;
  for (int i = 1, l = 0; i <= 9; i++) {
    l += cs[i];
    mulmod(p, nck(l, cs[i]));
  }

  int sum = 0;
  for (int i = 1; i <= 9; i++)
    if (cs[i] > 0) {
      int d =
	(ll)p * powmod(nck(n, cs[i]), MOD - 2) % MOD *
	nck(n - 1, cs[i] - 1) % MOD * tsum % MOD * i % MOD;
      addmod(sum, d);
    }

  printf("%d\n", sum);
  return 0;
}