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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, s, t;
    cin >> n >> s >> t;
    s--, t--;
    vector<ll> a(n), sumv(2 * n + 1);
    for(auto &&v : a) cin >> v;
    for(int i = 0; i < 2 * n; i++){
        sumv[i + 1] = sumv[i] + a[i >= n ? i - n : i];
    }
    auto f = [&](int s, int t){
        int len1, len2;
        ll v = 0;
        if(s < t){
            len1 = t - (s + 1), len2 = s + n - (t + 1);
            s += n;
        }else{
            len1 = t + n - (s + 1), len2 = s - (t + 1);
        }
        v = 2 * (sumv[s + len1 / 2 + 1] - sumv[s - len2 / 2]) - sumv[n];
        if(len1 % 2 == 1){
            v = max(v, 2 * (sumv[s + len1 / 2 + 2] - sumv[s - len2 / 2]) - sumv[n]);
        }
        if(len2 % 2 == 1){
            v = max(v, 2 * (sumv[s + len1 / 2 + 1] - sumv[s - len2 / 2 - 1]) - sumv[n]);
        }
        return v;
    };
    cout << f(s, t) << '\n';
}