#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e9 + 7;
const int ZERO = 25000;
int dp[501][50000];
long long f[501], g[501];

long long modpow(long long x, long long p, long long mod) {
  long long ret = 1;
  while (p) {
    if (p & 1)
      ret = ret * x % mod;
    x = x * x % mod;
    p >>= 1;
  }
  return ret;
}

long long comb(int n, int k) {
  return f[n] * g[n-k] % MOD * g[k] % MOD;
}

void init() {
  f[0] = g[0] = 1;
  for (int i = 1; i <= 500; i++) {
    f[i] = f[i-1] * i % MOD;
    g[i] = modpow(f[i], MOD-2, MOD);
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  init();
  
  int T, a, b, c, d, e;
  cin >> T >> a >> b >> c >> d >> e;

  dp[0][ZERO] = 1;
  for (int t = 0; t < T; t++) {
    for (int i = 0; i < 50000; i++) {
      if (dp[t][i]) {
        (dp[t+1][i-b] += dp[t][i]) %= MOD;
        (dp[t+1][i+b] += dp[t][i]) %= MOD;
        (dp[t+1][i-c] += dp[t][i]) %= MOD;
        (dp[t+1][i+c] += dp[t][i]) %= MOD;
      }
    }
  }

  for (int t = 0; t <= T; t++) {
    for (int i = 1; i < 50000; i++)
      dp[t][i] = (dp[t][i] + dp[t][i-1]) % MOD;
  }

  long long ret = 0;
  for (int l = 0; l <= T; l++) {
    for (int r = 0; l + r <= T; r++) {
      int x = r - l;
      long long tmp = dp[T - l - r][ZERO + e - a * x] - dp[T - l - r][ZERO + d - a * x - 1];
      if (tmp < 0)
        tmp += MOD;
      tmp = tmp * comb(T, l) % MOD;
      tmp = tmp * comb(T-l, r) % MOD;
      ret += tmp;
      ret %= MOD;
    }
  }

  cout << ret << endl;
  
  return 0;
}