#include using namespace std; typedef long long ll; typedef pair PII; const int MM = 1e9 + 7; const double eps = 1e-8; const int MAXN = 2e6 + 10; int n, m; void prework(){ } void read(){ } int a, b, c, d, e; int T; int f[502][20010]; void upd(int &x, int y){ x += y; if (x >= MM) x -= MM; } void solve(int casi){ // cout << "Case #" << casi << ": "; cin >> T; cin >> a >> b >> c >> d >> e; f[0][10000] = 1; for (int i = 1; i <= T; i++){ for (int j = 0; j <= 20000; j++) if (f[i-1][j]){ upd(f[i][j+a], f[i-1][j]); upd(f[i][j+b], f[i-1][j]); upd(f[i][j+c], f[i-1][j]); upd(f[i][j-a], f[i-1][j]); upd(f[i][j-b], f[i-1][j]); upd(f[i][j-c], f[i-1][j]); } } ll ans = 0; for (int i = d + 10000; i <= e + 10000; i++){ ans += f[T][i]; } printf("%lld\n", ans % MM); } void printans(){ } int main(){ // std::ios::sync_with_stdio(false); prework(); int T = 1; // cin>>T; for(int i = 1; i <= T; i++){ read(); solve(i); printans(); } return 0; }