import sys, math, itertools, functools, collections
input = sys.stdin.readline

def solve(testcase):
    n = int(input())
    a = [*map(int, input().split())]
    psa = [0]
    for i in a:
        psa.append(psa[-1]+i)
    def query(x, y):
        return psa[y+1] - psa[x]
    def ans(x, y):
        if x < y:
            m = (x+y) // 2
            return query(0, m)
        m = (x+y+1) // 2
        return query(m, n-1)
    la, ra, lb, rb = map(int, input().split())
    la -= 1
    ra -= 1
    lb -= 1
    rb -= 1
    res = 0
    for i in range(la, ra+1):
        cur = 10**20
        candidates = [lb, rb]
        if lb <= i+1 <= rb:
            candidates.append(i+1)
        if lb <= i-1 <= rb:
            candidates.append(i-1)
        for j in candidates:
            if i != j:
                cur = min(cur, ans(i, j))
        res = max(res, cur)
    print('Case #'+str(testcase)+':', res)


for testcase in range(1, int(input())+1):
    solve(testcase)