#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
	lint L, R, A, B, C;
	cin >> L >> R >> A >> B >> C;

	mint a=0, b=0, c=0, x, y, z;
	if (A+B > R-L) drop(0);
	if (C > R-L) drop(0);
	if (A+B >= C) {
		x = R-L-(A+B)+1;
		a = x*(x+1)*(x+2)/6;
	} else {
		x = R-L-C+1;
		y = C-(A+B)+1;
		a = x*(x+1)*(3*y+x-1)/6;
	}
	std::cout << a.val() << '\n';
}