#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

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


	int N;
	cin >> N;
	int s, t;
	cin >> s >> t;
	s--;
	t--;

	ll kei = 0;
	int A[100000];
	rep(i, N) {
		cin >> A[i];
		kei += A[i];
	}

	int a = (t - s - 1 + N + N) % N;
	int b = (s - t - 1 + N + N) % N;

	if (a % 2 && b % 2) {
		ll tmp = 0;
		rep1(i, a / 2) tmp += A[(s + i) % N];
		rep1(i, b / 2 + 1) tmp += A[(s - i + N) % N];
		ll kari = tmp;
		tmp = 0;
		rep1(i, a / 2 + 1) tmp += A[(s + i) % N];
		rep1(i, b / 2) tmp += A[(s - i + N) % N];
		kari = max(kari, tmp);
		co(kari + A[s] + kari + A[s] - kei);
	}
	else {
		ll tmp = 0;
		rep1(i, (a + 1) / 2) tmp += A[(s + i) % N];
		rep1(i, (b + 1) / 2) tmp += A[(s - i + N) % N];
		ll kari = tmp;
		co(kari + A[s] + kari + A[s] - kei);
	}

	Would you please return 0;
}