T = int(input())
for case in range(1, T+1):
    n = int(input())
    a = list(map(int, input().split()))
    la, ra, lb, rb = map(int, input().split())

    alice = bob = 0
    taken = [False] * n
    for i in range(la-1, ra):
        alice += a[i]
        taken[i] = True

    for i in range(lb-1, rb):
        if not taken[i]:
            bob += a[i]

    best_alice = alice
    alice_left = alice_right = 0
    for i in range(la-2, -1, -1):
        alice_left += a[i]
        if not taken[i]:
            for j in range(rb-1, n):
                if not taken[j]:
                    bob += a[j]
                    taken[j] = True
                    break
        best_alice = max(best_alice, alice_left + bob)

    alice_left = alice_right = 0
    for i in range(ra, n):
        alice_right += a[i]
        if not taken[i]:
            for j in range(lb-2, -1, -1):
                if not taken[j]:
                    bob += a[j]
                    taken[j] = True
                    break
        best_alice = max(best_alice, alice_right + bob)

    print("Case #{}: {}".format(case, best_alice))