#include <bits/stdc++.h>
using namespace std;
const int M = (int)1e9 + 7;
int a[17];
int c[107][107];
int dp[17][107];
int n;
int main() {
  cin >> n;
  for (int i = 0; i < 10; i++) cin >> a[i];
  for (int i = 0; i <= 100; i++) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; j++) {
      c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % M;
    }
  }
  int ans = 0;
  dp[10][0] = 1;
  for (int dig = 9; dig >= 0; dig--) {
    for (int cnt = a[dig]; cnt <= n; cnt++) {
      for (int rem = 0; rem + cnt <= n; rem++) {
        dp[dig][cnt + rem] =
            (dp[dig][cnt + rem] +
             (dp[dig + 1][rem] * 1ll * c[cnt + rem - (dig ? 0 : 1)][cnt] % M)) %
            M;
      }
    }
  }
  for (int len = 1; len <= n; len++) ans = (ans + dp[0][len]) % M;
  cout << ans << '\n';
  return 0;
}
