#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

#include <atcoder/modint>
using mint = atcoder::modint1000000007;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  vector<mint> fact(1'000'001, 1);
  for (int i = 1; i <= 1'000'000; ++i) fact[i] = fact[i - 1] * i;
  int n;
  cin >> n;
  vector<int> c(9);
  rep(i, 9) cin >> c[i];
  mint ans = (mint(10).pow(n) - 1) / mint(9) * fact[n - 1];
  int sum = 0;
  rep(i, 9) sum += (i + 1) * c[i];
  rep(i, 9) ans /= fact[c[i]];
  ans *= sum;
  cout << ans.val() << '\n';
  return 0;
}