#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int N;
int s, t;
ll A[100000];

int dif(int i, int j){
    if(i > j) swap(i, j);
    return min(j-i, i+N-j);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> s >> t; s--; t--;
    for(int i = 0; i < N; i++){
        cin >> A[i];
    }
    ll l = 0, r = 0;
    if(N%2 == 1){
        for(int i = 0; i < N; i++){
            if(dif(s, i) <= dif(t, i)) l += A[i];
            if(dif(s, i) > dif(t, i)) r += A[i];
        }
        cout << l-r << endl;
        return 0;
    }else{
        if(abs(s-t) == 1){
            for(int i = 0; i < N; i++){
                if(dif(s, i) <= dif(t, i)) l += A[i];
                if(dif(s, i) > dif(t, i)) r += A[i];
            }
            cout << l-r << endl;
            return 0;
        }
        vector<ll> v;
        for(int i = 0; i < N; i++){
            if(dif(s, i) < dif(t, i)) l += A[i];
            if(dif(s, i) == dif(t, i)) v.push_back(A[i]);
            if(dif(s, i) > dif(t, i)) r += A[i];
        }
        if(v.size() == 0){
            cout << l-r << endl;
        }else{
            cout << l+max(v[0], v[1])-(r+min(v[0], v[1])) << endl;
        }
        return 0;
    }
}