#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
#define MOD 1000000007
using namespace std;
typedef long long ll;

ll T, A, B, C, D, E;
ll dp[501][30000];

int main(void) {
  cin >> T >> A >> B >> C >> D >> E;

  const ll P = 15000;
  REP(i, 0, 501) REP(j, 0, 30000) dp[i][j] = 0;
  dp[0][P] = 1;

  REP(t, 0, T) {
    REP(i, 0, 30000) {
      if(i + A < 30000) (dp[t + 1][i + A] += dp[t][i]) %= MOD;
      if(0 <= i - A)    (dp[t + 1][i - A] += dp[t][i]) %= MOD;
      if(i + B < 30000) (dp[t + 1][i + B] += dp[t][i]) %= MOD;
      if(0 <= i - B)    (dp[t + 1][i - B] += dp[t][i]) %= MOD;
      if(i + C < 30000) (dp[t + 1][i + C] += dp[t][i]) %= MOD;
      if(0 <= i - C)    (dp[t + 1][i - C] += dp[t][i]) %= MOD;
    }
  }

  ll ans = 0;
  REP(i, P + D, P + E + 1) (ans += dp[T][i]) %= MOD;
  cout << ans << endl;
}