n = int(input())
s, t = map(int, input().split())
s -= 1  # Convert to 0-based index
t -= 1
A = list(map(int, input().split()))

X = 0
Y = 0
equi = []

for u in range(n):
    # Compute minimal distance from s to u
    d_s1 = (u - s) % n
    d_s2 = (s - u) % n
    d_s = min(d_s1, d_s2)
    
    # Compute minimal distance from t to u
    d_t1 = (u - t) % n
    d_t2 = (t - u) % n
    d_t = min(d_t1, d_t2)
    
    if d_s < d_t:
        X += A[u]
    elif d_t < d_s:
        Y += A[u]
    else:
        equi.append(A[u])

# Sort equidistant vertices in descending order
equi.sort(reverse=True)

# Distribute equidistant vertices
for i in range(len(equi)):
    if i % 2 == 0:
        X += equi[i]
    else:
        Y += equi[i]

print(X - Y)