#include <iostream>
#include <iomanip>
#include <cstring>
#include <algorithm> 
#include <math.h>
#include <queue>
#include <functional>
#include <map>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int T, d, e;
int num[6];
ll dp[505][20005];

ll rec(int t, int k){
    if (dp[t][k] >= 0) return dp[t][k];
    if (t == T){
        if (d + 10000 <= k && k <= e + 10000) return dp[t][k] = 1;
        else return dp[t][k] = 0;
    }

    ll ret = 0;
    for (int i = 0; i < 6; i++){
        ret += rec(t + 1, k + num[i]);
        ret %= MOD;
    }

    return dp[t][k] = ret;
}
int main(void){
    cin >> T >> num[0] >> num[1] >> num[2] >> d >> e;
    for (int i = 0; i < 3; i++) num[i + 3] = -num[i];

    for (int i = 0; i <= T; i++)
        for (int j = 0; j <= 20000; j++) dp[i][j] = -1;
    
    cout << rec(0, 10000) << endl;
}