#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = 1LL << 60;//10^18 = 2^60
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;

vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};


ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}


//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

vector<ll> eff[1011][1010];

void Effinit(){
  for(ll i = 1; i < 1010; i++){
    for(ll j = 1; j < 1010; j++){
      eff[i][j].pb(1);
    }
  }
  for(ll i = 1; i < 1010; i++){
    for(ll j = 1; j < 1010; j++){
      for(ll k = 1; k < 1010; k++){
        if(i < j * k) break;
        if(k == 1){
          eff[i][j].pb(comb(i, j));
        }else{
          eff[i][j].pb(eff[i-j][j][k-1] * comb(i, j) % MOD);
        }
      }
    }
  }
}

ll memo[1010];

ll kai(ll x){
  if(memo[x] != 0) return memo[x];
  if(x == 0) return memo[x] = 1;
  return memo[x] = x * kai(x-1) % MOD;
}

void Invinit(){
  rep(i, 1010) memo[i] = inverse(memo[i]);
}

ll N, A, B, C, D;
ll dp[1010][1010];
ll t = 0;
void solve(){
  dp[0][0] = 1;
  for(ll i = 0; i <= N; i++){
    for(ll j = 0; j < N; j++){
      dp[i][j+1] += dp[i][j];
      dp[i][j+1] %= MOD;
      if(j+1 < A || B < j+1) continue;
      for(ll g = C; g <= D; g++){
        if(i+(j+1)*g > N) break;
        dp[i+(j+1)*g][j+1] += dp[i][j] * eff[N-i][j+1][g] % MOD * memo[g] % MOD;
        dp[i+(j+1)*g][j+1] %= MOD;
      }
    }
  }
  cout << dp[N][N] << endl;
}

int main(){
  COMinit();
  Effinit();
  kai(1009);
  Invinit();
  cin >> N >> A >> B >> C >> D;
  solve();
}


Measured memory_bytes: 100608