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

def sum_x(a, b, MOD, inv2):
    if a > b:
        return 0
    a_mod = a % MOD
    b_mod = b % MOD
    sum_b = (b_mod * (b_mod + 1)) % MOD
    sum_b = (sum_b * inv2) % MOD
    a_minus_1 = (a - 1) % MOD
    sum_a = (a_minus_1 * a_mod) % MOD
    sum_a = (sum_a * inv2) % MOD
    return (sum_b - sum_a) % MOD

def sum_x2(a, b, MOD, inv6):
    if a > b:
        return 0
    a_mod = a % MOD
    b_mod = b % MOD
    sum_b = (b_mod * (b_mod + 1)) % MOD
    sum_b = (sum_b * ((2 * b_mod + 1) % MOD)) % MOD
    sum_b = (sum_b * inv6) % MOD
    a_minus_1 = (a - 1) % MOD
    sum_a = (a_minus_1 * a_mod) % MOD
    sum_a = (sum_a * ((2 * a_mod - 1) % MOD)) % MOD
    sum_a = (sum_a * inv6) % MOD
    return (sum_b - sum_a) % MOD

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

X_max = min(R - A, R - C, R - (A + B))
if X_max < L:
    print(0)
else:
    if (C - B - A) >= 0:
        a = inv2
        term_b_numerator = (2 * (A + B - R) - 3) % MOD
        b = (term_b_numerator * inv2) % MOD
        term_c1 = ((C - B - A) % MOD) * ((R - C + 1) % MOD) % MOD
        term_c2_part1 = (R + 1 - C) % MOD
        term_c2_part2 = (R + 2 - C) % MOD
        term_c2 = (term_c2_part1 * term_c2_part2) % MOD
        term_c2 = (term_c2 * inv2) % MOD
        c = (term_c1 + term_c2) % MOD
    else:
        K = (R - B - A + 1) % MOD
        a = inv2
        term_b_numerator = (- (2 * K + 1)) % MOD
        b = (term_b_numerator * inv2) % MOD
        c_part = (K * (K + 1)) % MOD
        c = (c_part * inv2) % MOD

    sum_x2_val = sum_x2(L, X_max, MOD, inv6)
    sum_x_val = sum_x(L, X_max, MOD, inv2)
    cnt = (X_max - L + 1) % MOD
    total = (a * sum_x2_val + b * sum_x_val + c * cnt) % MOD
    print(total)