#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
const int inf = 1e9 + 7;
const ll INF = 1LL << 61;
const ll mod = 1e9 + 7;

template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int i, j;
    int n;
    cin >> n;
    int s, t;
    cin >> s >> t;
    s--;
    t--;
    ll a[n];
    for (i = 0; i < n; i++) cin >> a[i];
    ll sum[n];
    sum[0] = 0;
    for (i = 0; i < (n + 1) / 2; i++) {
        sum[0] += a[i];
    }
    ll u = 0;
    for (i = 0; i < n; i++) u += a[i];
    for (i = 1; i < n; i++) {
        sum[i] = sum[i - 1] - a[i - 1] + a[(i - 1 + (n + 1) / 2) % n];
        // cout << i << " " << sum[i] << endl;
    }
    ll ans = -INF;
    if (s < t) s += n;
    for (i = (s + t + 1) / 2; i + (n + 1) / 2 - 1 <= (s + t + n) / 2; i++) {
        chmax(ans, sum[i % n]);
    }
    cout << 2 * ans - u << endl;
}