import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

# xとzの距離をdと固定すると
# (x,zの取り方)*(yの取り方)が答
# Σ[d=max(A+B,C),R-L](R-L-d+1)*(d-A-B+1)をやる

def sigma(n):
    return -(n+1)*(2*n**2%md-3*n*p%md+3*n*q%md+n-6*p*q%md)%md*pow(6, md-2, md)%md

L, R = LI()
A, B, C = LI()

if max(A+B,C)>R-L:
    print(0)
    exit()

p = R-L+1
q = 1-A-B
ans = sigma(R-L)-sigma(max(A+B, C)-1)
print(ans%md)