#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <time.h>
#pragma warning(disable:4996) 

typedef long long ll;
typedef unsigned long long ull;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;



void solve()
{
    int n, s, t;
    scanf("%d%d%d", &n, &s, &t); s--; t--;
    vector<int> a(n);
    vector<ll> sa(n + 1);
    int i;
    for (i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        sa[i + 1] = sa[i]+a[i];
    }

    int num = (n + 1) / 2;
    int lim0, lim1;
    {
        int t2 = (t > s ? t : t + n);
        assert(t2 >= s);
        lim1=(s + t2) / 2;
        lim1 -= (num - 1);
        if(lim1 < 0) lim1 += n;
    }
    {
        int s2 = (s > t ? s : s + n);
        assert(s2 >= t);
        lim0=(s2 + t + 1) / 2;
        lim0 %= n;
    }

    if (lim1 < lim0) {
        lim1 += n;
    }
    ll ans = -LINF;
    for (i = lim0; i <= lim1; i++) {
        int i2 = i + (num - 1);
        if (i2 < n) {
            ll ans0 = sa[i2 + 1] - sa[i];
            ans = MAX(ans, ans0);
        }
        else {
            ll ans0 = sa[n] - sa[i] + sa[i2+1-n];
            ans = MAX(ans, ans0);
        }
    }
    ans = ans - (sa[n] - ans);
    printf("%lld\n", ans);

    return;
}

int main()
{
#if 1
    solve();
#else
    int T;
    scanf("%d", &T);
    int t;
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}