#include <bits/stdc++.h>

#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using ld = long double;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = (ll)1e9 + 7LL;
constexpr ld PI = static_cast<ld>(3.1415926535898);

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 10;


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    int a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    constexpr int MAX = 10000;
    vector<int> num(2 * MAX + 1, 0);
    num[MAX] = 1;
    const int dv[6] = {a, -a, b, -b, c, -c};
    for (int i = 0; i < T; i++) {
        vector<int> tmp(2 * MAX + 1, 0);
        for (int v = -MAX; v <= MAX; v++) {
            const int ind = v + MAX;
            if (num[ind] == 0) {
                continue;
            }
            for (int j = 0; j < 6; j++) {
                const int nextind = v + dv[j] + MAX;
                tmp[nextind] += num[ind];
                tmp[nextind] %= MOD;
            }
        }
        num = tmp;
    }
    ll sum = 0;
    for (int i = d; i <= e; i++) {
        sum += num[i + MAX];
        sum %= MOD;
    }
    cout << sum << endl;

    return 0;
}