def f(a, b):
    if a<b:
        return S[a+(b-a)//2+1]
    else:
        return S[-1]-S[b+(a-b+1)//2]

T = int(input())
for tt in range(T):
    N = int(input())
    A = list(map(int, input().split()))
    La, Ra, Lb, Rb = map(int, input().split())
    La -= 1
    Lb -= 1

    S = [0]*(len(A)+1)
    for i in range(len(A)):
        S[i+1] = S[i]+A[i]
    if Ra<=Lb:
        ans = f(Ra-1, Lb)
    elif Rb<=La:
        ans = f(La, Rb-1)
    else:
        ans = 0
        for a in range(La, Ra):
            if a<Lb:
                t = f(a, Lb)
            elif Rb<=a:
                t = f(a, Rb-1)
            else:
                t = S[-1]
                if Lb<=a-1<Rb:
                    t = min(t, f(a, a-1))
                if Lb<=a+1<Rb:
                    t = min(t, f(a, a+1))
            ans = max(ans, t)
    print(f"Case #{tt+1}: {ans}")