from math import inf

def solve(N, A, L1, R1, L2, R2):
    pref = [0]
    for x in A:
        pref.append(pref[-1] + x)
    best = 0
    for i in range(L1, R1 + 1):
        cands = [L2, R2]
        if L2 <= i - 1 <= R2:
            cands.append(i - 1)
        if L2 <= i + 1 <= R2:
            cands.append(i + 1)
        temp = inf
        for j in cands:
            if i == j:
                continue
            if i < j:
                m = (i + j) // 2
                temp = min(temp, pref[m + 1])
            if j < i:
                m = (i + j - 1) // 2
                temp = min(temp, pref[-1] - pref[m + 1])
        
        best = max(best, temp)
    return best


if __name__ == "__main__":
    T = int(input())
    for t in range(1, T + 1):
        (N,) = [int(x) for x in input().split()]
        A = [int(x) for x in input().split()]
        L1, R1, L2, R2 = [int(x) - 1 for x in input().split()] # 0 indexed
        ans = solve(N, A, L1, R1, L2, R2)
        print("Case #" + str(t) + ": " + str(ans))