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

N = int(input())
s,t = map(int,input().split())
A = list(map(int,input().split()))
SUM = sum(A)
X = A+A+A
SS = list(accumulate([0]+X))
ans = 0
M = (N+1)//2
if s<t:
    s += N
s -= 1
t -= 1
I = (s+t+1)//2
    
T = t+N
J = (T+s)//2
while I+M<=J+1:
    ans = max(ans,SS[I+M] - SS[I])
    I += 1
print(2*ans-SUM)