#!/usr/bin/python3

import sys, math, os
#import re, string, fractions, itertools
#import bisect, heapq
#from fractions import Fraction
#from functools import reduce


LocaL = "MATE_DESKTOP_SESSION_ID" in os.environ

def mle_assert(x):
    if LocaL:
        assert x
    elif not x:
        x = list(range(10**8))


def tle_assert(x):
    if LocaL:
        assert x
    elif not x:
        for i in range(10000):
            for j in range(1000):
                for k in range(1000):
                    pass


sys.setrecursionlimit(10000)
#Z = 10**9 + 7
ssr = sys.stdin.readline
ssw = sys.stdout.write
ssf = sys.stdout.flush
sew = sys.stderr.write
def rdline(): return ssr().strip()
def rdstrs(): return ssr().split()
def rdints(): return list(map(int, ssr().split()))
def rd1int(): return int(rdline())



def do_one_case(cnum):
    N = rd1int()
    assert N<200
    A = rdints()
    assert len(A)==N
    La, Ra, Lb, Rb = rdints()

    t = 0
    S = []
    for a in A:
        t += a
        S.append(t)
    #print(S)

    m = -77
    for i in range(La-1, Ra):
      mn = 999999999999999999
      for j in range(Lb-1, Rb):
        if j<i:
            k = (i+j-1)//2
            b = S[k]
            a = S[N-1] - S[k]
        elif j>i:
            k = (i+j+2)//2
            b = S[N-1] - S[k-1]
            a = S[k-1]
        else:
            assert i==j
            continue
        mn = min(mn,a)
        #print(i, b1, b2, a1, a2, a, m)
      m = max(m,mn)

        
    print(f"Case #{cnum}: {m}")




def main():
    T = rd1int()
    for i in range(T):
        do_one_case(i+1)
        sys.stdout.flush()


if __name__ == "__main__":
    main()