#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
//const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

int main() {
    ll s, t;
    cin>>N>>s>>t;
    --s; --t;
    if(s < t) s += N;
    vec a(N), temp(0);
    rep(i,N) cin>>a[i];
    ll X = a[s%N], k = s;
    while( (k - 1) - t > s - (k - 1)){
        --k;
        X += a[k%N];
    }
    if((k - 1) - t == s - (k - 1)) temp.push_back(a[(k-1)%N]);
    k = s;
    while((k + 1) - s < (t + N) - (k + 1)){
        ++k;
        X += a[k%N];
    }
    if((k + 1) - s == (t + N) - (k + 1)) temp.push_back(a[(k+1)%N]);
    if(!temp.empty()) X += *max_element(ALL(temp));
    cout<<X * 2 - accumulate(ALL(a), 0LL)<<endl;
}