#include<cstdio>
long long a[100005];
int vis[100005];
int bad[100005], good[100005];
long long sum[100005];

long long min(long long a,long long b){ return a>b?b:a; }

long long max(long long a,long long b){ return a>b?a:b; }

void doMove(int s,int t,int n,int da,int db){
    for(int i = 0; i < n; i++) vis[i] = 0;
    vis[s] = vis[t] = 1;
    good[s] = 1, bad[t] = 1;
    int pa = s, pb = t;
    while(true){
        int na = pa+da, nb = pb+db;
        if(na>=n) na -= n;
        if(nb>=n) nb -= n;
        if(na<0) na += n;
        if(nb<0) nb += n;
        if(vis[na] && vis[nb]) break;
        if(!vis[na]){
            vis[na] = 1;
            good[na] = 1;
        }
        if(!vis[nb]){
            vis[nb] = 1;
            bad[nb] = 1;
        }
        pa = na, pb = nb;
    }
}

long long getSegmentSum(int p,int len,int n){
    long long res = 0;
    if(p+len-1>n){
        res += sum[n]-sum[p-1];
        len -= (n-p+1);
        p = 1;
    }
    res += sum[p+len-1]-sum[p-1];
    return res;
}

long long getSum(int l,int len,int n){
    long long res = 0;
    if(l+len-1>n-1){
        res += sum[n-1];
        if(l!=0) res -= sum[l-1];
        l = (l+len-1)%n;
        res += sum[l];
    }
    else{
        res += sum[l+len-1];
        if(l!=0) res -= sum[l-1];
    }
    return res;
}

int main(){
    int n,s,t;
    scanf("%d%d%d",&n,&s,&t);
    s--, t--;
    long long all = 0;
    for(int i = 0; i < n; i++){ 
        scanf("%lld",&a[i]);
        all += a[i];
    }
    sum[0] = a[0];
    for(int i = 1; i < n; i++) sum[i] = sum[i-1]+a[i];
    doMove(s,t,n,1,-1);
    doMove(s,t,n,-1,1);
    /*for(int i = 0; i < n; i++) printf("%d",good[i]);
    printf("\n");
    for(int i = 0; i < n; i++) printf("%d",bad[i]);
    printf("\n");*/
    int have = n/2+n%2;
    long long ans = -1, fix = 0;
    for(int i = 0; i < n; i++){
        int l = s-i, r = s-i+have-1;
        l %= n, r %= n;
        if(l<0) l += n;
        if(r<0) r += n;
        if(good[l] && good[r]){
            long long cur = getSum(l,have,n);
            //printf("l = %d, cur = %lld\n",l,cur);
            cur = cur-(all-cur);
            if(!fix) ans = cur, fix = 1;
            else{
                if(cur>ans) ans = cur;
            }
        }
    }
    printf("%lld\n",ans);
    return 0;
}