#include <bits/stdc++.h>
using namespace std;

long long n, s, t, res = 0;
vector<long long> a;

int main() {
  cin >> n >> s >> t;
  a.resize(n);
  for (int i = 0; i < n; ++i) cin >> a[(i + n + 1 - s) % n];
  t = (t + n - s) % n;
  s = 0;
  res = a[0] - a[t];
  int len = (t - 1) / 2;
  for (int i = 1; i <= len; ++i) res += a[i] - a[t - i];
  vector<long long> v;
  if ((t - 1) & 1) v.push_back(a[len + 1]);
  len = (n - t - 1) / 2;
  for (int i = 1; i <= len; ++i) res += a[n - i] - a[t + i];
  if ((n - t - 1) & 1) v.push_back(a[t + len + 1]);
  sort(v.begin(), v.end());
  if (v.size()) res += v.back();
  if (v.size() > 1) res -= v[0];
  cout << res << endl;
  return 0;
}