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

using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

int main() {
    int N;
    int s, t;
    cin >> N >> s >> t;
    --s, --t;
    V<int> A(N);
    rep(i, N) cin >> A[i];
    ll all = accumulate(ALL(A), 0ll);

    VV<int> vec;
    for (int d : {1, -1}) {
        int v = s;
        V<int> cur;
        while (true) {
            v = (v + N + d) % N;
            if (v == t) break;
            cur.pb(A[v]);
        }
        debug(cur);
        vec.pb(cur);
    }

    ll ans = -TEN(18);
    int sz1 = SZ(vec[0]), sz2 = SZ(vec[1]);
    if (sz1 % 2) {
        swap(sz1, sz2);
        swap(vec[0], vec[1]);
    }
    if (sz1 % 2) {
        {
            ll sum = 0;
            rep(i, (sz1 + 1) / 2) { sum += vec[0][i]; }
            rep(i, sz2 / 2) sum += vec[1][i];
            chmax(ans, sum);
        }
        {
            ll sum = 0;
            rep(i, (sz2 + 1) / 2) { sum += vec[1][i]; }
            rep(i, sz1 / 2) sum += vec[0][i];
            chmax(ans, sum);
        }
    } else if (sz1 % 2 == 0 && sz2 % 2 == 1) {
        ll sum = 0;
        rep(i, (sz2 + 1) / 2) { sum += vec[1][i]; }
        rep(i, sz1 / 2) sum += vec[0][i];
        ans = sum;
    } else {
        ll sum = 0;
        rep(i, sz1 / 2) sum += vec[0][i];
        rep(i, sz2 / 2) sum += vec[1][i];
        ans = sum;
    }
    ans += A[s];
    cout << ans * 2 - all << endl;

    return 0;
}