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

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=Int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  Int n;
  cin>>n;
  Int s,t;
  cin>>s>>t;
  s--;t--;
  auto as=read(n);

  vector<Int> xs,ys;
  for(Int i=(s+1)%n;i!=t;i=(i+1)%n)
    xs.emplace_back(as[i]);
  for(Int i=(s+n-1)%n;i!=t;i=(i+n-1)%n)
    ys.emplace_back(as[i]);

  Int ans=as[s]-as[t];
  if(xs.size()&1 and ys.size()&1){
    ans+=max(xs[xs.size()/2],ys[ys.size()/2]);
    ans-=min(xs[xs.size()/2],ys[ys.size()/2]);
  }else if(xs.size()&1){
    ans+=xs[xs.size()/2];
  }else if(ys.size()&1){
    ans+=ys[ys.size()/2];
  }

  for(Int i=0;i<(Int)xs.size()/2;i++) ans+=xs[i]-xs[xs.size()-(i+1)];
  for(Int i=0;i<(Int)ys.size()/2;i++) ans+=ys[i]-ys[ys.size()-(i+1)];

  cout<<ans<<newl;
  return 0;
}