#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;

int main(void) {
  constexpr int mod = int(powl(10, 9)) + 7;
  int T; scanf("%d", &T);
  int a, b, c, d, e; scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
  unordered_map<int, int> dp, ndp;
  dp[0] = 1;
  for(int t=0; t<T; ++t) {
    ndp.clear();
    for(auto&& kv : dp) {
      int cur = kv.first;
      (ndp[cur + a] += dp[cur]) %= mod;
      (ndp[cur - a] += dp[cur]) %= mod;
      (ndp[cur + b] += dp[cur]) %= mod;
      (ndp[cur - b] += dp[cur]) %= mod;
      (ndp[cur + c] += dp[cur]) %= mod;
      (ndp[cur - c] += dp[cur]) %= mod;
    }
    dp = ndp;
  }
  int res = 0;
  for(int r=d; r<=e; ++r) {
    (res += dp[r]) %= mod;
  }
  printf("%d\n", res);
  return 0;
}