import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

n = II()
s, t = LI1()
aa = LI()*2

ss = [0]*n
d = (n+1)//2
ss[0] = sum(aa[:d])
for i in range(n-1):
    ss[i+1] = ss[i]-aa[i]+aa[i+d]
# print(ss)

if s < t:
    l = (t+n+s+1)//2
    r = (t+s)//2
else:
    l = (t+s+1)//2
    r = (t+s+n)//2
if l > r: l -= n
# print(l,r)

mx = 0
for i in range(l, r-d+2):
    i %= n
    mx = max(mx, ss[i])

s = sum(aa[:n])
ans = mx-(s-mx)
print(ans)