#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF INT_MAX/3

#define mod 1000000007

ll t,l,r;
ll a[3];
ll dp[505][20001];

int main(){
  cin>>t;
  rep(i,3)cin>>a[i];
  cin>>l>>r;

  dp[0][10000]=1;
  rep(i,t){
    rep(j,20001)rep(k,3){
      if(j+a[k]<=20000)(dp[i+1][j+a[k]]+=dp[i][j])%=mod;
      if(j-a[k]>=0)(dp[i+1][j-a[k]]+=dp[i][j])%=mod;
    }
  }

  ll res=0;
  repl(j,l+10000,r+10000+1){
    (res+=dp[t][j])%=mod;
  }
  cout<<res<<endl;

	return 0;
}