#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=1000000007,MAX=200005,INF=1<<30;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N;cin>>N;
    int s,t;cin>>s>>t;
    s--;t--;
    vector<ll> A(N);
    ll sum=0;
    for(int i=0;i<N;i++){
        cin>>A[i];
        sum+=A[i];
    }
    
    if(s>t){
        s=N-1-s;t=N-1-t;
        reverse(all(A));
    }
    
    int mid1=s+(t-s)/2,mid2=t+(s+N-t+1)/2;
    ll sum1=0,sum2=0;
    for(int i=0;i<(N+1)/2;i++){
        sum1+=A[(N+mid1-i)%N];
        sum2+=A[(N+mid2+i)%N];
    }
    
    cout<<max(sum1-(sum-sum1),sum2-(sum-sum2))<<endl;
}