#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int N;
    cin >> N;
    int s, t;
    cin >> s >> t;
    s--, t--;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];
    ll sum = 0;
    rep(i, N) sum += A[i];
    vector<ll> B, C;
    for(int i = s + 1; i != t; i = (i + 1) % N) {
        B.pb(A[i]);
    }
    for(int i = (s - 1 + N) % N; i != t; i = (i - 1 + N) % N) {
        C.pb(A[i]);
    }
    int bs = B.size(), cs = C.size();
    ll X = A[s], Y = A[t];
    for(int i = 0; i < bs / 2; i++)
        X += B[i];
    for(int i = 0; i < cs / 2; i++)
        X += C[i];
    if(bs % 2 == 0 && cs % 2 == 0) {

    } else if(bs % 2 == 1 && cs % 2 == 0) {
        X += B[bs / 2];
    } else if(bs % 2 == 0 && cs % 2 == 1) {
        X += C[cs / 2];
    } else {
        X += max(B[bs / 2], C[cs / 2]);
    }
    Y = sum - X;
    cout << X - Y << endl;
    return 0;
}