//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, s, t;
    cin >> n >> t >> s;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    rep(i, n)
    {
        a.push_back(a[i]);
    }
    rep(i, n)
    {
        a.push_back(a[i]);
    }
    ll sum_a = 0, sum_b = 0;
    s--;
    t--;
    if (s < t)
    {
        s += n;
    }
    if (n % 2 && (s - t) % 2)
    {
        for (int i = t; i <= t + (s - t) / 2; i++)
        {
            sum_a += a[i];
        }
        for (int i = s; i >= s - (s - t) / 2; i--)
        {
            sum_b += a[i];
        }
        t += n;
        for (int i = s + 1; i < s + (t - s) / 2; i++)
        {
            sum_b += a[i];
        }
        for (int i = t - 1; i >= t - (t - s) / 2; i--)
        {
            sum_a += a[i];
        }
    }
    else if (n % 2)
    {
        for (int i = t; i <= t + (s - t) / 2; i++)
        {
            sum_a += a[i];
        }
        for (int i = s; i > s - (s - t) / 2; i--)
        {
            sum_b += a[i];
        }
        t += n;
        for (int i = s + 1; i <= s + (t - s) / 2; i++)
        {
            sum_b += a[i];
        }
        for (int i = t - 1; i >= t - (t - s) / 2; i--)
        {
            sum_a += a[i];
        }
    }
    else if (n % 2 == 0 && (s - t) % 2)
    {
        for (int i = t; i <= t + (s - t) / 2; i++)
        {
            sum_a += a[i];
        }
        for (int i = s; i >= s - (s - t) / 2; i--)
        {
            sum_b += a[i];
        }
        t += n;
        for (int i = s + 1; i <= s + (t - s) / 2; i++)
        {
            sum_b += a[i];
        }
        for (int i = t - 1; i >= t - (t - s) / 2; i--)
        {
            sum_a += a[i];
        }
    }
    else
    {
        for (int i = t; i < t + (s - t) / 2; i++)
        {
            sum_a += a[i];
        }
        for (int i = s; i > s - (s - t) / 2; i--)
        {
            sum_b += a[i];
        }
        t += n;
        for (int i = s + 1; i < s + (t - s) / 2; i++)
        {
            sum_b += a[i];
        }
        for (int i = t - 1; i > t - (t - s) / 2; i--)
        {
            sum_a += a[i];
        }
        int temp = a[s - (s - t - n) / 2];
        int temp1 = a[s + (t - s) / 2];
        sum_a+=max(temp,temp1);
        sum_b+=min(temp,temp1);
    }
    cout<<sum_a-sum_b<<"\n";
}