#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
//-------------------
constexpr int MX = 1e5+3;
ll A[MX];
ll x[MX];

int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    int n; cin >> n;
    int s,t; cin >> s >> t; s--; t--;
    rep(i,n) cin >> A[i];

    ll sm = 0;
    rep(i,n) sm += A[i];

    auto last = [&](int k) {
        return (k+(n+1)/2-1)%n;
    };
    auto diff = [&](int i, int k) {
        if(i < k) swap(i, k);
        return min(abs(k+n-i), abs(i-k));
    };
    ll xx = 0;
    rep(i, (n+1)/2) {
        xx += A[i];
    }
    x[0] = xx; 
    FOR(i,1,n-1) {
        x[i] = x[i-1] - A[i-1] + A[last(i)];
        // cout << last(i) << " " << x[i] << endl;;
    }

    ll ans = -LINF;
    rep(i,n) {
        // cout << diff(s, i) << " " << diff(t, i) << " " << diff(s, last(i)) << " " << diff(t, last(i)) << endl;
        if(diff(s, i) <= diff(t, i)  and diff(s, last(i)) <= diff(t, last(i))) {
            // cout << i << endl;
            chmax(ans, x[i]);
        }
    }

    cout << ans*2 - sm << endl;
    return 0;
}