def product_mod(*X):
    y=1
    for x in X:
        y=(y*(x%Mod))%Mod
    return y

def solve(L,R,A,B,C):
    C2=max(0,C-(A+B))
    D=R+1-(L+A+B+C2)

    if D<0:
        return 0

    inv_6=pow(6,Mod-2,Mod)
    return product_mod(inv_6, D, D+1, 2+3*C2+D)

#==================================================
L,R=map(int,input().split())
A,B,C=map(int,input().split())

Mod=998244353

print(solve(L,R,A,B,C))