#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__) #define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout< ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout< ostream& operator <<(ostream &o, const pair p) { o << "(" << p.first << ":" << p.second << ")"; return o; } template inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); } template inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); } template T& maxset(T& to, const T& val) { return to = max(to, val); } template T& minset(T& to, const T& val) { return to = min(to, val); } void bye(string s, int code = 0) { cout << s << endl; exit(0); } mt19937_64 randdev(8901016); inline ll rand_range(ll l, ll h) { return uniform_int_distribution(l, h)(randdev); } #if defined(_WIN32) || defined(_WIN64) #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #elif __GNUC__ #else #define getchar_unlocked getchar #define putchar_unlocked putchar #endif namespace { #define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'>(int& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiblechar(cc); cc = getchar_unlocked()); for (; isvisiblechar(cc); cc = getchar_unlocked()) var.push_back(cc); } template void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; class MaiPrinter { public: template void output_integer(T var) { if (var == 0) { putchar_unlocked('0'); return; } if (var < 0) putchar_unlocked('-'), var = -var; char stack[32]; int stack_p = 0; while (var) stack[stack_p++] = '0' + (var % 10), var /= 10; while (stack_p) putchar_unlocked(stack[--stack_p]); } inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; } inline MaiPrinter& operator<<(int var) { output_integer(var); return *this; } inline MaiPrinter& operator<<(long long var) { output_integer(var); return *this; } inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; } inline MaiPrinter& operator<<(const string& str) { const char* p = str.c_str(); const char* l = p + str.size(); while (p < l) putchar_unlocked(*p++); return *this; } template void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; } }; } MaiScanner scanner; MaiPrinter printer; // class llmod { // private: // ll val_; // inline ll cut(ll v) const { return ((v%MOD) + MOD) % MOD; } // public: // static const ll MOD = MD; // <= // // llmod() : val_(0) {} // llmod(ll num) :val_(cut(num)) {} // llmod(const llmod& lm) : val_(lm.val_) {} // // inline operator ll() const { return val_; } // inline ll operator *() const { return val_; } // inline llmod& operator=(const llmod& lm) { val_ = lm.val_; return *this; } // inline llmod& operator=(ll v) { val_ = cut(v); return *this; } // // inline llmod& operator+=(ll v) { val_ = cut(val_ + v); return *this; } // inline llmod& operator+=(const llmod& l) { val_ = cut(val_ + l.val_); return *this; } // inline llmod& operator-=(ll v) { val_ = cut(val_ - v); return *this; } // inline llmod& operator-=(const llmod& l) { val_ = cut(val_ - l.val_); return *this; } // inline llmod& operator*=(ll v) { val_ = cut(val_ * v); return *this; } // inline llmod& operator*=(const llmod& l) { val_ = cut(val_ * l.val_); return *this; } // inline llmod& operator++() { val_ = (val_ + 1) % MOD; return *this; } // inline llmod operator++(int) { llmod t = *this; val_ = (val_ + 1) % MOD; return t; } // }; // ostream& operator<<(ostream& os, const llmod& l) { os << *l; return os; } // // inline llmod operator+(llmod t, const llmod& r) { return t += r; } // inline llmod operator-(llmod t, const llmod& r) { return t -= r; } // inline llmod operator*(llmod t, const llmod& r) { return t *= r; } // // // // // MEMO : 逆元...powm(n,MD-2) // llmod pow(llmod x, ll p) { // llmod y = 1; // while (0 < p) { // if (p % 2) // y *= x; // x *= x; // p /= 2; // } // return y; // } // // inline llmod& operator/=(llmod& l, const llmod& r) { return l *= pow(r, llmod::MOD - 2); } ll te, aa, bb, cc, dd, ee; int main() { scanner >> te >> aa >> bb >> cc >> dd >> ee; dd += 10010; ee += 10010; valarray dp(20020); valarray dp2(20020); dp[10010] = 1; ll left = 10010; ll right = 10010; ll abc = max({ abs(aa),abs(bb),abs(cc) }); repeat(lop, te) { dp2 = 0; for (ll x = left; x <= right; ++x) { ll y = dp[x] = dp[x] % MD; dp2[x + aa] += y; dp2[x - aa] += y; dp2[x + bb] += y; dp2[x - bb] += y; dp2[x + cc] += y; dp2[x - cc] += y; } dp2.swap(dp); left -= abc; right += abc; } ll ans = 0; for (ll x = dd; x <= ee; ++x) { ans = (ans + dp[x]) % MD; } cout << ans << endl; exit(0); return 0; }