#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int N;
    cin >> N;
    int s, t;
    cin >> s >> t;
    s--, t--;
    ll A[N];
    rep(i, N) cin >> A[i];
    ll x = 0, y = 0;
    vector<ll> keep;
    rep(i, N){
        int a = abs(s-i), b = abs(t-i);
        a = min(a, N-a), b = min(b, N-b);
        if(a < b) x += A[i];
        elif(a > b) y += A[i];
        else keep.pb(A[i]);
    }
    if(sz(keep) <= 1){
        for(auto &e: keep) x += e;
    }
    else x += max(keep[0], keep[1]), y += min(keep[0], keep[1]);
    cout << x-y << endl;
}