#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N, s, t;
  cin >> N >> s >> t;
  s--; t--;
  vector<lint> A(N*2);
  REP(i, N) cin >> A[i];
  REP(i, N) A[i+N] = A[i];
  vector<lint> list1;
  if(s < t) {
    FOR(i, s+1, t) list1.push_back(A[i]);
  } else {
    FOR(i, s+1, t+N) list1.push_back(A[i]);
  }
  vector<lint> list2;
  if(s < t) {
    IFOR(i, t+1, s+N) list2.push_back(A[i]);
  } else {
    IFOR(i, t+1, s) list2.push_back(A[i]);
  }
  lint X = A[s];
  lint Y = A[t];
  if(list1.size()%2 == 1 && list2.size()%2 == 1) {
    X += max(list1[list1.size()/2], list2[list2.size()/2]);
    Y += min(list1[list1.size()/2], list2[list2.size()/2]);
  } else if(list1.size()%2 == 1) {
    X += list1[list1.size()/2];
  } else if(list2.size()%2 == 1) {
    X += list2[list2.size()/2];
  }
  REP(i, list1.size()/2) {
    X += list1[i];
    Y += list1[list1.size()-1-i];
  }
  REP(i, list2.size()/2) {
    X += list2[i];
    Y += list2[list2.size()-1-i];
  }
  cout << X-Y << endl;
}