//#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;

/*
#include "boost/multiprecision/cpp_int.hpp"
#include "boost/multiprecision/cpp_dec_float.hpp"
namespace mp = boost::multiprecision;
typedef mp::cpp_int LL;
typedef mp::number<mp::cpp_dec_float<1024>> DD;// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)
*/
 
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define rrep(i,r,l) for(ll i=r;i>=l;i--)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
//#define endl "\n"  //インタラクティブで消す！！！！！！！！！！！！！！！！！！！！！
#define SORT(v) sort(v.begin(),v.end())
#define ERASE(v) v.erase(unique(v.begin(),v.end()),v.end())
#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
template<class T,class S>
inline bool chmax(T &a, S b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}
template<class T,class S>
inline bool chmin(T &a, S b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

void mod_print(ll k){
    ll P=50000;
    rep(y,1,P){
        ll x=mod(y*k);
        
        if(abs(x)<=P||x+P>=i_7){
            if(x+P>=i_7){
                x-=i_7;
            }
            cout<<x<<"/"<<y<<endl;
            //cout<<setprecision(5)<<(dd)x/(dd)y;
            return;
        }
    }
    cout<<"nun"<<endl;
}
#define all(c) c.begin(),c.end()
typedef vector<ll> vl;
//////////////////////////

ll g1=-1,g2=-1;
void che(ll s,ll t,ll n){
    if(s>t)swap(s,t);
    ll g3=(n+s+t)/2;
    if(g3>n)g3-=n;
    if(abs(n+s-t)%2==0){
        g2=g3;
    }
}
#define N 100005
ll n;
ll a[N];
void c1(ll &ans,ll s,ll t){
    while(1){
        ll aa=abs(s-t);
        if(aa<=2)return;
        if(s<t){
            s++;t--;
            if(s<=n)ans+=a[s];
            else ans+=a[s-n];
        }else{
            s--;t++;
            if(s<=n)ans+=a[s];
            else ans+=a[s-n];
        }
    }
}

int main(){fastio
    ll s,t;cin>>n>>s>>t;
    ll sum=0;
    rep(i,1,n){
        cin>>a[i];
        sum+=a[i];
    }
    if(abs(t-s)%2==0){
        g1=(t+s)/2;
    }
    che(s,t,n);
    ll ans=a[s];
    if(g1!=-1&&g2!=-1){
        ans+=max(a[g1],a[g2]);
    }else if(g1!=-1){
        ans+=a[g1];
    }else{
        ans+=a[g2];
    }
    c1(ans,s,t);
    if(s>t){
        c1(ans,s,t+n);
    }else{
        c1(ans,s+n,t);
    }
   // cout<<ans<<endl;
    cout<<ans-(sum-ans)<<endl;
    
    return 0;
}