#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using u64 = uint_fast64_t;
using pii =  pair<int, int>;
using pll =  pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N; cin >> N;
    int s,t; cin >> s >> t;
    --s; --t;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];

    vector<ll> L,R;
    int cur = (s-1+N)%N;
    while (cur != t) {
        L.emplace_back(A[cur]);
        cur--;
        if (cur < 0) cur = N-1;
    }
    cur = (s+1)%N;
    while (cur != t) {
        R.emplace_back(A[cur]);
        cur++;
        if (cur >= N) cur = 0;
    }
    ll X = A[s];
    int l = L.size();
    int r = R.size();
    if (N&1) {
        rep(i,(l+1)/2) {
            X += L[i];
        }
        rep(i,(r+1)/2) {
            X += R[i];
        }
    } else {
        rep(i,l/2) X += L[i];
        rep(i,r/2) X += R[i];
        if (l&1) X += max(L[l/2],R[r/2]); 
    }

    ll S = accumulate(all(A),0LL);
    cout << X*2 - S << ln;
}