#include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
int main(){
  int N;
  cin >> N;
  int s, t;
  cin >> s >> t;
  s--;
  t--;
  s += N;
  if (t + N < s){
    t += N;
  }
  vector<int> A(N * 3);
  for (int i = 0; i < N; i++){
    cin >> A[i];
    A[N + i] = A[i];
    A[N * 2 + i] = A[i];
  }
  vector<long long> S(N * 3 + 1);
  S[0] = 0;
  for (int i = 0; i < N * 3; i++){
    S[i + 1] = S[i] + A[i];
  }
  long long ans = -INF;
  for (int i = 0; i < N * 2; i++){
    int j = i + (N + 1) / 2;
    if (t <= i && i <= s && j >= s){
      if (s - i <= i - t && j - s - 1 <= (t + N) - j + 1){
        long long X = S[j] - S[i];
        long long Y = S[N] - X;
        ans = max(ans, X - Y);
      }
    }
  }
  cout << ans << endl;
}