#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

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

  int n, s, t;
  cin >> n >> s >> t;

  --s, --t;
  vector<int> a(n);
  REP (i, n) cin >> a[i];

  long long ret = a[s] - a[t];

  vector<int> b;
  for (int i = (s+1) % n; i != t; i = (i + 1) % n) {
    b.push_back(a[i]);
  }

  vector<int> c;
  for (int i = (s-1+n) % n; i != t; i = (i-1+n) % n) {
    c.push_back(a[i]);
  }

  int bl = b.size();
  int cl = c.size();

  REP (i, bl/2) ret += b[i] - b[bl-1-i];
  REP (i, cl/2) ret += c[i] - c[cl-1-i];

  vector<int> rem;
  if (bl % 2) rem.push_back(b[bl/2]);
  if (cl % 2) rem.push_back(c[cl/2]);

  sort(rem.rbegin(), rem.rend());
  if (rem.size() > 0) ret += rem[0];
  if (rem.size() > 1) ret -= rem[1];
  
  cout << ret << endl;

  return 0;
}