#include<iostream> #include<string> #include<vector> #include<algorithm> #include<bitset> #include<set> #include<map> #include<stack> #include<queue> #include<deque> #include<list> #include<iomanip> #include<cmath> #include<cstring> #include<functional> #include<cstdio> #include<cstdlib> using namespace std; #define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep(i, n) repr(i, 0, n) #define INF 2e9 #define MOD 1000000007 //#define MOD 998244353 #define LINF (long long)4e18 #define jck 3.141592 const double EPS = 1e-10; using ll = long long; using Pi = pair<int,int>; using Pl = pair<ll,ll>; int main(){ int n; cin >> n; int s,t; cin >> s >> t; s--; t--; vector<int> a(n*3); rep(i,n) cin >> a[i]; rep(i,n){ a[i+n] = a[i+2*n] = a[i]; } vector<ll> sum(n*3+1); rep(i,3*n) sum[i+1] = sum[i]+a[i]; int mid2 = (s+t+2*n)/2; int mid1 = (s+t+n)/2; int mid3 = (s+t+3*n)/2; ll ans = 0; if(s < t){ int k = (n+1)/2; if((s+t+n)%2 == 1) mid1++; repr(i,mid1,mid2-k+2){ ll now = sum[i+k]-sum[i]; ans = max(ans,now); } } else{ int k = (n+1)/2; if((s+t)%2 == 1) mid2++; repr(i,mid2,mid3-k+2){ ll now = sum[i+k]-sum[i]; ans = max(ans,now); } } ll ans2 = sum[n]-ans; cout << ans-ans2 << endl; }