#include <bits/stdc++.h>
using namespace std;

int main(){
    int N, S, T;
    cin >> N >> S >> T;
    S--; T--;
    vector<int64_t> A(2*N), sum(2*N+1);
    for(int i=0; i<N; i++){
        cin >> A[i];
        A[i+N] = A[i];
    }
    for(int i=0; i<2*N; i++) sum[i+1] = sum[i] + A[i];
    int num = (N+1)/2;

    if(S < T) S += N;
    int M1 = (S+T+1)/2;
    S %= N;
    if(T < S) T += N;
    int M2 = (S+T)/2 - num + 1;
    if(M2 < M1) M2 += N;

    int64_t mx = 0;
    for(int s=M1; s<=M2; s++){
        int s1 = s%N;
        mx = max(mx, sum[s1+num]-sum[s1]);
    }

    cout << mx-(sum[N]-mx) << endl;
    return 0;
}