#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, S, T;
	cin >> N >> S >> T;
	--S; --T;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	
	ll sum = accumulate(ALL(A), 0ll);
	
	ll x = 0;
	vector<int> ev;
	REP(i, N) {
		auto dist = [N](int u, int v) {
			return min((u - v + N) % N, (v - u + N) % N);
		};
		int ds = dist(S, i), dt = dist(T, i);
		if (ds <= dt) {
			x += A[i];
			if (ds == dt) ev.emplace_back(A[i]);
		}
	}
	
	if (ev.size() == 2) x -= min(ev[0], ev[1]);
	cout << 2 * x - sum << endl;
}