from __future__ import print_function
import time
import sys
from math import pi

sys.setrecursionlimit(10002)
#INFILE = open('1.in')
INFILE=sys.stdin


def solve(n,nx,la,ra,lb,rb):
    la-=1
    ra-=1
    lb-=1
    rb-=1
    g=[0]*n
    for i,a in enumerate(nx):
        g[i]=(g[i-1] if i>0 else 0) + a
    res=0
    for i in range(la,ra+1):
        if lb>=i:
            m=(i+max(i+1,lb))//2
            sa=g[m]
        elif rb<=i:
            m=(i+min(rb,i-1)+1)//2
            sa=g[n-1]-(g[m-1] if m>0 else 0)
        else:
            sa=min(g[i],g[n-1]-(g[i-1] if i>0 else 0))
        res=max(res,sa)
    return res


def read_input(fi):
    read = lambda type: type(fi.readline().rstrip('\n').rstrip('\r'))
    readArray = lambda type: list(map(type, fi.readline().split()))
    readMatrix = lambda type, x: [list(map(type, fi.readline().split())) for i in range(x)]
    readLines = lambda type, x: [type(fi.readline().rstrip('\n').rstrip('\r')) for i in range(x)]
    n=read(int)
    nx=readArray(int)
    la,ra,lb,rb=readArray(int)
    return (n,nx,la,ra,lb,rb)


def main():
    time0 = time.time()
    t = int(INFILE.readline())
    # _ = int(INFILE.readline())
    for ti in range(t):
        time1 = time.time()
        ans = "Case #%d: %s" % (ti + 1, solve(*read_input(INFILE)))
        sys.stderr.write("%.3f\t" % (time.time() - time1))
        print(ans)
    sys.stderr.write("%.3f\n" % (time.time() - time0))
    if INFILE != sys.stdin:
        INFILE.close()


if __name__ == '__main__':
    main()
    # print (check('RSP'*20))
    # print(check('R'*20+'S'*20+'P'*20))
    # print(check('R'*20+'S'*30+'P'*10))
    # print(test(16))
    # print(test1())