#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, s, t; cin >> n >> s >> t; --s; --t;
  vector<int> a(n); REP(i, n) cin >> a[i];
  rotate(a.begin(), a.begin() + s, a.end());
  t = (t - s + n) % n;
  ll ans = a[0] - a[t];
  vector<int> wh;
  for (int p = 1, q = t - 1; p <= q; ++p, --q) {
    if (p < q) {
      ans += a[p] - a[q];
    } else {
      wh.emplace_back(a[p]);
    }
  }
  for (int p = n - 1, q = t + 1; q <= p; --p, ++q) {
    if (q < p) {
      ans += a[p] - a[q];
    } else {
      wh.emplace_back(a[p]);
    }
  }
  if (wh.size() == 1) {
    ans += wh[0];
  } else if (wh.size() == 2) {
    ans += max(wh[0], wh[1]) - min(wh[0], wh[1]);
  }
  cout << ans << '\n';
  return 0;
}