#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 22000
#else
#define SIZE 22000
#endif

int N,M,Q,T;
int D[3];
int MI,MA;
int DP[555][SIZE];
int MOD=1e9+7;

void solve() {
    cin>>T;
    REP(i,3)cin>>D[i];
    cin>>MI>>MA;
    REP(i,3)REP(j,2) {
        int n = (j) ? D[i] : -D[i];
        DP[0][n+SIZE/2] += 1;
    }
    REP(t,T)REP(n,SIZE) {
        if (!DP[t][n]) continue;
        REP(i,3)REP(j,2) {
            int diff = (j) ? D[i] : -D[i];
            (DP[t+1][n+diff] += DP[t][n])%=MOD;
        }
    }
    int ans = 0;
    FOR(n,MI,MA+1) {
        (ans += DP[T-1][n+SIZE/2])%=MOD;
    }
    cout << ans << endl;
}