#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    int n; cin>>n;
    int s, t; cin>>s>>t;
    s--; t--;
    ll a[200010];
    ll tot=0;
    for(int i=0; i<n; i++){
        cin>>a[i];
        tot+=a[i];
    }
    if(s>t){
        reverse(a, a+n);
        s=n-1-s, t=n-1-t;
    }
    for(int i=0; i<n; i++) a[i+n]=a[i];
    int m1=t-s-1, m2=n-2-m1;
    ll sum=a[s];
    for(int i=1; i<=(m1+1)/2; i++){
        sum+=a[s+i];
    }
    for(int i=1; i<=(m2+1)/2; i++){
        sum+=a[n+s-i];
    }
    if(m1%2==1 && m2%2==1){
        sum-=min(a[s+(m1+1)/2], a[n+s-(m2+1)/2]);
    }
    cout<<2*sum-tot<<endl;
    return 0;
}