#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, s, t;
    cin >> N >> s >> t;
    --s, --t;
    vector<int> A(N);
    for(int i = 0; i < N; ++i)  cin >> A[i];

    ll ans = A[s] - A[t];
    vector<int> B, C;
    int i = (s - 1 + N) % N;
    while(i != t){
        B.emplace_back(A[i]);
        i = (i - 1 + N) % N;
    }
    i = (s + 1) % N;
    while(i != t){
        C.emplace_back(A[i]);
        i = (i + 1) % N;
    }
    int n = B.size(), m = C.size();
    vector<ll> SB(n + 1), SC(m + 1);
    for(int i = 0; i < n; ++i)  SB[i + 1] = SB[i] + B[i];
    for(int i = 0; i < m; ++i)  SC[i + 1] = SC[i] + C[i];
    if(n % 2 == 0 && m % 2 == 0){
        ans += SB[n / 2] + SC[m / 2];
        ans -= SB[n] - SB[n / 2] + SC[m] - SC[m / 2];
    }
    else if(n % 2 == 0){
        ans += SB[n / 2] + SC[(m + 1) / 2];
        ans -= SB[n] - SB[n / 2] + SC[m] - SC[(m + 1) / 2];
    }
    else if(m % 2 == 0){
        ans += SB[(n + 1) / 2] + SC[m / 2];
        ans -= SB[n] - SB[(n + 1) / 2] + SC[m] - SC[m / 2];
    }
    else{
        ll sum = 0, sum2 = 0;
        sum += SB[(n + 1) / 2] + SC[m / 2];
        sum -= SB[n] - SB[(n + 1) / 2] + SC[m] - SC[m / 2];
        sum2 += SB[n / 2] + SC[(m + 1) / 2];
        sum2 -= SB[n] - SB[n / 2] + SC[m] - SC[(m + 1) / 2];
        ans += max(sum, sum2);
    }

    cout << ans << endl;

    return 0;
}