import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

inv2 = pow(2,MOD-2,MOD)
inv6 = pow(6,MOD-2,MOD)

def sumk(a):
    return a*(a+1)%MOD*inv2%MOD

def sumk2(a):
    return a*(a+1)%MOD*(2*a+1)%MOD*inv6%MOD

def main():
    L,R = map(int,input().split())
    A,B,C = map(int,input().split())

    btm = max(A+B,C)
    top = R - L

    if btm > top:
        print(0);exit()

    beta = top + 1
    alpha = 1 - (B+A)

    #print(top,btm)

    ans = 0
    ans -= sumk2(top) - sumk2(btm-1)
    ans += (beta - alpha) * (sumk(top) - sumk2(btm-1)) %MOD
    ans += alpha * beta %MOD * (top - btm + 1) %MOD

    print(ans%MOD)


if __name__ == '__main__':
    main()