#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(long long i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
mint sum(long long x) {
	mint ret = x;
	ret *= x + 1;
	ret /= 2;
	return ret;
}
mint sum2(long long x) {
	mint ret = x;
	ret *= x + 1;
	ret *= 2 * x + 1;
	ret /= 6;
	return ret;
}
mint m(long long x) {
	return x;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long l, r; cin >> l >> r;
	long long d = r - l;
	long long a, b, c; cin >> a >> b >> c;
	long long mni = max(c, a + b);
	long long mxi = d;
	if (mni > mxi) {
		cout << 0 << endl;
		return 0;
	}
	long long x = d + 1;
	long long y = a + b - 1;
	/*
		Σ(x-i)(i-y)
		Σ(x+y)i - Σi^2-Σxy
	*/
	mint ans = 0;
	ans += (sum(mxi) - sum(mni - 1)) *(x + y);
	ans -= sum2(mxi) - sum2(mni - 1);
	ans -= (m(mxi) - m(mni - 1))*x * y;
	cout << ans.val() << endl;
	return 0;
}