#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin>>n;
    int s,t;
    cin>>s>>t;
    s--;t--;
    vector<ll> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    vector<ll> b;
    vector<ll> c;
    int ns = s;
    ll ans = a[s] - a[t];
    while(true){
        ns++;
        ns %= n;
        if(ns==t) break;
        b.push_back(a[ns]);
    }
    ns = s;
    while(true){
        ns = (ns-1+n)%n;
        if(ns==t) break;
        c.push_back(a[ns]);
    }
    int p = b.size();
    int q = c.size();
    if(p%2==0&&q%2==0){
        for(int i = 0;i<b.size();i++){
            if(i<p/2) ans += b[i];
            else ans -= b[i];
        }
        for(int i = 0;i<c.size();i++){
            if(i<q/2) ans += c[i];
            else ans -= c[i];
        }
    }else if(p%2==1&&q%2==0){
        for(int i = 0;i<b.size();i++){
            if(i<=p/2) ans += b[i];
            else ans -= b[i];
        }
        for(int i = 0;i<c.size();i++){
            if(i<q/2) ans += c[i];
            else ans -= c[i];
        }
    }else if(p%2==0&&q%2==1){
        for(int i = 0;i<b.size();i++){
            if(i<p/2) ans += b[i];
            else ans -= b[i];
        }
        for(int i = 0;i<c.size();i++){
            if(i<=q/2) ans += c[i];
            else ans -= c[i];
        }
    }else{
        for(int i = 0;i<b.size();i++){
            if(i==p/2) continue;
            if(i<p/2) ans += b[i];
            else ans -= b[i];
        }
        for(int i = 0;i<c.size();i++){
            if(i==q/2) continue;
            if(i<q/2) ans += c[i];
            else ans -= c[i];
        }
        ans += max(b[p/2],c[q/2]);
        ans -= min(b[p/2],c[q/2]);
    }
    cout<<ans<<endl;
}